2228 search results - page 114 / 446 » Distributed Data Clustering Can Be Efficient and Exact |
185
click to vote
ICDCS
2000
IEEE
15 years 11 months ago
2000
IEEE
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
240
click to vote
MOBIHOC
2005
ACM
16 years 6 months ago
2005
ACM
This paper proposes a new principle for designing MAC protocols for spread spectrum based ad hoc networks ? inducing spatial clustering in contending transmitters/receivers. We fi...
196
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
209
click to vote
COMGEO
2008
ACM
15 years 6 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
239
click to vote
TASE
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper presents a robust calibration procedure for clustered wireless sensor networks. Accurate calibration of between-node distances is one crucial step in localizing sensor n...