Restrict to: Header Title Order by: Expected citations Hubs Usage Date Try: Google (CiteSeer) Google (Web) Yahoo! MSN CSB DBLP
35 documents found.
Order: number of citations.
Finding Surprising Patterns in a Time Series Database in.. - Keogh, Lonardi, Chiu (2002)
(Correct) (16 citations)
Space Eamonn Keogh eamonn@cs.ucr.edu Stefano Lonardi stelo@cs.ucr.edu Bill `Yuan-chi' Chiu
REFERENCES 1] A. Apostolico, M. E. Bock, and S. Lonardi. Monotony of surprise and large-scale quest for
DC, April 2002. 2] A. Apostolico, M. E. Bock, S. Lonardi, and X. Xu. E#cient detection of unusual words.
www.cse.unsw.edu.au/~qzhang/papers/p21.pdf
Approximation Algorithms for Grammar-Based Compression - Lehman, Shelat (2002)
(Correct) (6 citations)
emphasizes avoiding local minima. Apostolico and Lonardi [1] proposed a greedy algorithm (hereafter
about a log n factor. 4.4 Greedy Apostolico and Lonardi [1] considered greedy algorithms for
compression. References 1] A. Apostolico and S. Lonardi. Some Theory and Practice of Greedy OLine
theory.lcs.mit.edu/~abhi/LehmanShelat-SODA02.ps
Efficient Detection of Unusual Words - Apostolico, Bock, Lonardi, Xu (2000)
(Correct) (3 citations)
Apostolico, 1 Mary Ellen Bock, 2 Stefano Lonardi, 3 And Xuyan Xu 3 Abstract Words That Are, By
[15] A. Apostolico, M.E. Bock, S. Lonardi and X. Xu. Efficient Detection of Unusual Words.
Words Alberto Apostolico, Mary Ellen Bock, Stefano Lonardi, Xuyan X
www.cs.bgu.ac.il/~melkman/AdvancedAlgorithms/projects/unusual.ps
Finding Motifs in Time Series - Lin, Keogh, Lonardi, Patel (2002)
(Correct) (2 citations)
Motifs in Time Series Eamonn Keogh Stefano Lonardi University of California -Riverside Computer
pp 211-220. 4] Apostolico, A.Bock, M. E. Lonardi, S. 2002)Monotony of surprise and large-scale
Management. Bethesda, MD. pp 267-272. 28] Lonardi, S. 2001)Global Detectors of Unusual Words:
www.cs.ucr.edu/~stelo/papers/motif_KDD.pdf
Mining Motifs in Massive Time Series Databases - Patel, Keogh, Lin, Lonardi (2002)
(Correct) (2 citations)
Pranav Patel Eamonn Keogh Jessica Lin Stefano Lonardi University of California -Riverside Computer
pp 211-220. 4] Apostolico, A.Bock, M. E. Lonardi, S. 2002)Monotony of surprise and large-scale
Management. Bethesda, MD. pp 267-272. 28] Lonardi, S. 2001)Global Detectors of Unusual Words:
www.cs.ucr.edu/~stelo/papers/motif_ICDM.pdf
Some Theory and Practice of Greedy Off-line Textual.. - Apostolico, Lonardi (1998)
(Correct) (2 citations)
Substitution Alberto Apostolico Stefano Lonardi Purdue University and Universit`a di Padova 1
[3] A. Apostolico and S. Lonardi. Some theory and practice of greedy off-line
Textual Substitution Alberto Apostolico, Stefano Lonard
www.cs.purdue.edu/homes/stelo/papers/dcc98.ps.gz
Verbumculus: Fast Discovery and Visualization of Unusual Words - Apostolico, Lonardi (2000)
(Correct) (1 citation)
Unusual Words Alberto Apostolico and Stefano Lonardi Department of Computer Sciences, Purdue
References 1] Apostolico, A.Bock, M. E.Lonardi, S.and Xu, X. Ecient detection of unusual
[1] A. Apostolico and S. Lonardi. Verbumculus: Fast Discovery and Visualization
www.cs.purdue.edu/homes/stelo/papers/sw.ps.gz
Off-line Compression by Greedy Textual Substitution - Apostolico, Lonardi (2000)
(Correct) (1 citation)
Textual Substitution Alberto Apostolico Stefano Lonardi Purdue University and Universita di Padova
in Mol. Biol. 98, pp. 8-16, June 1998. 44] S. Lonardi, OLine Data Compression by Textual
[Apostolico 85 Lonardi, 2000] Apostolico, A. 85 Lonardi, S. 2000)
www.cs.purdue.edu/homes/stelo/papers/procieee.ps.gz
A Note On Sequence Prediction - Travis Gagie Department
(Correct)
number of distinct #tuples in S minus 1. Janson, Lonardi and Szpankowski [3] showed the expected number
University Press, 1957. 3] S. Janson, S. Lonardi, and W. Szpankowski. On average sequence
www.cs.toronto.edu/~travis/cwit1.pdf
On Average Sequence Complexity - Janson, Lonardi, Szpankowski (2004)
(Correct)
Sequence Complexity Svante Janson a Stefano Lonardi b Wojciech Szpankowski c a Department of
85-96. 15 2] Apostolico, A.Bock, M. E.and Lonardi, S. Monotony of surprise and largescale quest
pp. 283-311. 3] Apostolico, A.Bock, M. E.Lonardi, S.and Xu, X. Ecient detection of unusual
www.cs.purdue.edu/homes/spa/papers/complexity.ps
An Approach to Phrase Selection for Offline Data Compression - Turpin, Smyth (2002)
(Correct)
1999]This paper expands on work of Apostolico &Lonardi. Recently they introduced the Offline
introduced the Offline compressor [Apostolico &Lonardi, 2000]which calculates a measure of
component will be. Accordingly, Apostolico and Lonardi experimented with three approximate gain
www.cs.ucr.edu/~stelo/papers/extra/./turpin_smyth_acsc2002_camera_ready.ps
Error Resilient LZ'77 Scheme and Its Analysis - Stefano Lonardi Dept
(Correct)
Resilient LZ'77 Scheme and Its Analysis #Stefano Lonardi Dept. Computer Science &Eng. University of
is irrational. References 1] Atallah, M. J.and Lonardi, S.Authentication of LZ-77 compressed data. In
J. Combinatorial Theory, A65, 237-269, 1994. 4] Lonardi, S.Szpankowski, W.Joint source-channel LZ'77
www.cs.purdue.edu/homes/spa/papers/isit04-lz.ps
Gridding and Compression of Microarray Images - Stefano Lonardi And
(Correct)
and Compression of Microarray Images Stefano Lonardi and Yu Luo Department of Computer Science and
and Compression of Microarray Images Stefano Lonardi An
www.cs.ucr.edu/~stelo/papers/CSB04_lonardi.pdf
Analysis of a Randomized Selection Algorithm Motivated by.. - Ward, Szpankowski (2004)
(Correct)
that multiplicity of LZ'77 phrases is used in Lonardi and Szpankowski [13] to design an error
Massachusetts: Addison Wesley, 1997)13] Stefano Lonardi and Wojciech Szpankowski, Joint source-channel
www.cs.purdue.edu/homes/spa/papers/analco.ps
DMKD' 03, J une 13, 2003, San D i ego, CA, USA.. - Symbolic..
(Correct)
Algorithms Jessica Lin Eamonn Keogh Stefano Lonardi Bill Chiu University of California -Riverside
pp 211-220. 3] Apostolico, A.Bock, M. E. Lonardi, S. 2002)Monotony of Surprise and Large-Scale
Alberta, Canada. pp 102-111. 24] Keogh, E.Lonardi, S. Chiu, W. 2002)Finding Surprising
www.cs.ucr.edu/~eamonn/SAX.pdf
Optimization Methods for Data Compression - Motta (2002)
(Correct)
Helfgott and Cohn [1997, 1998]Apostolico and Lonardi [1998, 2000] also addressed issues arising in
Society Press, 302-309. A. Apostolico and S. Lonardi [1998]Some Theory and Practice of Greedy
Society Press, 119-128. A. Apostolico and S. Lonardi [2000]Compression of Biological Sequences by
www.cs.brandeis.edu/~gim/./Papers/Thesis_Brandeis.pdf
First 20 documents Next 20
Try your query at:
Google (CiteSeer) Google (Web) Yahoo! MSN CSB DBLP
CiteSeer.IST - Copyright Penn State and NEC