5592 search results - page 1003 / 1119 » On Random Betweenness Constraints |
144
Voted
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
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...
132
click to vote
EDBT
2006
ACM
16 years 4 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
135
click to vote
MOBISYS
2004
ACM
16 years 4 months ago
2004
ACM
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...
149
Voted
MOBIHOC
2005
ACM
16 years 4 months ago
2005
ACM
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
199
Voted
MOBIHOC
2005
ACM
16 years 4 months ago
2005
ACM
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...