4560 search results - page 856 / 912 » Finding Data in the Neighborhood |
MOBISYS
2007
ACM
14 years 7 months ago
2007
ACM
We report on the design, implementation, and evaluation of a system called Cedar that enables mobile database access with good performance over low-bandwidth networks. This is acc...
MOBIHOC
2005
ACM
14 years 7 months ago
2005
ACM
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
DCC
2007
IEEE
14 years 7 months ago
2007
IEEE
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
Clock synchronization is a crucial basic service in typical sensor networks, since the observations of distributed sensors more often than not need to be ordered ("a happened...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...