Sciweavers

1538 search results - page 269 / 308
» Relative Randomness and Cardinality
Sort
View
ICALP
2009
Springer
15 years 10 months ago
Annotations in Data Streams
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
Amit Chakrabarti, Graham Cormode, Andrew McGregor
SIGMOD
2005
ACM
77views Database» more  SIGMOD 2005»
15 years 9 months ago
On Joining and Caching Stochastic Streams
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
Jun Yang 0001, Junyi Xie, Yuguo Chen
PODS
2005
ACM
151views Database» more  PODS 2005»
15 years 9 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
MOBISYS
2004
ACM
15 years 9 months ago
Impact of Radio Irregularity on Wireless Sensor Networks
In this paper, we investigate the impact of radio irregularity on the communication performance in wireless sensor networks. Radio irregularity is a common phenomenon which arises...
Gang Zhou, Tian He, Sudha Krishnamurthy, John A. S...
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
15 years 7 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra