Sciweavers

223 search results - page 32 / 45
» Approximate Frequency Counts over Data Streams
Sort
View
ACIVS
2008
Springer
15 years 4 months ago
Sub-optimal Camera Selection in Practical Vision Networks through Shape Approximation
Within a camera network, the contribution of a camera to the observations of a scene depends on its viewpoint and on the scene configuration. This is a dynamic property, as the sc...
Huang Lee, Linda Tessens, Marleen Morbée, H...
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
15 years 1 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
SODA
2004
ACM
173views Algorithms» more  SODA 2004»
14 years 11 months ago
Tabulation based 4-universal hashing with applications to second moment estimation
We show that 4-universal hashing can be implemented efficiently using tabulated 4-universal hashing for characters, gaining a factor of 5 in speed over the fastest existing method...
Mikkel Thorup, Yin Zhang
IMC
2006
ACM
15 years 3 months ago
Approximate fingerprinting to accelerate pattern matching
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
Ramaswamy Ramaswamy, Lukas Kencl, Gianluca Iannacc...
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
14 years 11 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...