Sciweavers

73 search results - page 4 / 15
» Counting triangles in data streams
Sort
View
STACS
2010
Springer
15 years 4 months ago
Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window
The past decade has witnessed many interesting algorithms for maintaining statistics over a data stream. This paper initiates a theoretical study of algorithms for monitoring distr...
Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung...
EMNLP
2011
13 years 9 months ago
Approximate Scalable Bounded Space Sketch for Large Data NLP
We exploit sketch techniques, especially the Count-Min sketch, a memory, and time efficient framework which approximates the frequency of a word pair in the corpus without explic...
Amit Goyal, Hal Daumé III
MMSEC
2006
ACM
220views Multimedia» more  MMSEC 2006»
15 years 3 months ago
Robust blind watermarking mechanism for motion data streams
The commercial reuse of 3D motion capture (Mocap) data in animation and life sciences raises issues with respect to its copyright. In order to improvise content protection of Moca...
Parag Agarwal, Ketaki Adi, B. Prabhakaran
ICDE
2009
IEEE
171views Database» more  ICDE 2009»
15 years 11 months ago
A Framework for Clustering Massive-Domain Data Streams
In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each a...
Charu C. Aggarwal
ICDE
2005
IEEE
135views Database» more  ICDE 2005»
15 years 11 months ago
Finding (Recently) Frequent Items in Distributed Data Streams
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...
Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere...