Sciweavers

3 search results - page 1 / 1
» Why simple hash functions work: exploiting the entropy in a ...
Sort
View
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
13 years 6 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
KDD
2003
ACM
170views Data Mining» more  KDD 2003»
14 years 5 months ago
Efficient decision tree construction on streaming data
Decision tree construction is a well studied problem in data mining. Recently, there has been much interest in mining streaming data. Domingos and Hulten have presented a one-pass...
Ruoming Jin, Gagan Agrawal
MOBICOM
2006
ACM
13 years 10 months ago
On optimal communication cost for gathering correlated data through wireless sensor networks
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
Junning Liu, Micah Adler, Donald F. Towsley, Chun ...