| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Stefano Lonardi Alberto Apostolico , Fang-Cheng Gong , Stefano Lonardi: Verbumculus and the Discovery of Unusual Words. J. Comput. Sci. Technol. 19 (1): 22-41 (2004) Jie Zheng , Timothy J. Close , Tao Jiang , Stefano Lonardi: Efficient Selection of Unique and Popular Oligos for Large EST Databases. CPM 2003 : 384-401 Stefano Lonardi, Wojciech Szpankowski : Joint Source-Channel LZ'77 Coding. DCC 2003 : 273-282 Jessica Lin , Eamonn J. Keogh , Stefano Lonardi, Bill Yuan-chi Chiu : A symbolic representation of time series, with implications for streaming algorithms. DMKD 2003 : 2-11 Bill Yuan-chi Chiu , Eamonn J. Keogh , Stefano Lonardi: Probabilistic discovery of time series motifs. KDD 2003 : 493-498 Mikhail J. Atallah , Stefano Lonardi: Authentication of LZ-77 Compressed Data. SAC 2003 : 282-287 Pranav Patel , Eamonn J. Keogh , Jessica Lin , Stefano Lonardi: Mining Motifs in Massive Time Series Databases. ICDM 2002 : 370-377 Eamonn J. Keogh , Stefano Lonardi, Bill Yuan-chi Chiu : Finding surprising patterns in a time series database in linear time and space. KDD 2002 : 550-556 Alberto Apostolico , Mary Ellen Bock , Stefano Lonardi: Monotony of surprise and large-scale quest for unusual words. RECOMB 2002 : 22-31 Alberto Apostolico , Stefano Lonardi: A speed-up for the commute between subword trees and DAWGs. Inf. Process. Lett. 83 (3): 159-161 (2002) Alberto Apostolico , Stefano Lonardi: Compression of Biological Sequences by Greedy Off-Line Textual Substitution. Data Compression Conference 2000 : 143-152 Alberto Apostolico , Mary Ellen Bock , Stefano Lonardi, Xuyan Xu : Efficient Detection of Unusual Words. Journal of Computational Biology 7 (1-2): 71-94 (2000) Alberto Apostolico , Mary Ellen Bock , Stefano Lonardi: Linear Global Detectors of Redundant and Rare Substrings. Data Compression Conference 1999 : 168-177 Alberto Apostolico , Stefano Lonardi: Some Theory and Practice of Greedy Off-Line Textual Substitution. Data Compression Conference 1998 : 119-128 1 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 14 ] 2 [ 9 ] 3 [ 2 ] [ 3 ] [ 6 ] 4 [ 7 ] [ 10 ] [ 11 ] 5 [ 13 ] 6 [ 14 ] 7 [ 13 ] 8 [ 7 ] [ 8 ] [ 10 ] [ 11 ] 9 [ 8 ] [ 11 ] 10 [ 8 ] 11 [ 12 ] 12 [ 3 ] 13 [ 13 ]  ©2004 Association for Computing Machinery |
