Sciweavers

91 search results - page 11 / 19
» The Data Stream Space Complexity of Cascaded Norms
Sort
View
116
Voted
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 2 days ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
15 years 6 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
SDM
2007
SIAM
182views Data Mining» more  SDM 2007»
15 years 1 months ago
Distance Preserving Dimension Reduction for Manifold Learning
Manifold learning is an effective methodology for extracting nonlinear structures from high-dimensional data with many applications in image analysis, computer vision, text data a...
Hyunsoo Kim, Haesun Park, Hongyuan Zha
PODS
2010
ACM
232views Database» more  PODS 2010»
15 years 4 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
110
Voted
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
15 years 1 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...