2924 search results - page 342 / 585 » Lower Bounds in Distributed Computing |
226
click to vote
GIS
2009
ACM
16 years 5 months ago
2009
ACM
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions inc...
153
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
142
click to vote
MOBIHOC
2006
ACM
16 years 4 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
166
click to vote
TPDS
2008
15 years 4 months ago
2008
The localization of sensor nodes is a fundamental problem in sensor networks and can be implemented using powerful and expensive beacons. Beacons, the fewer the better, can acquire...
133
click to vote
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...