2374 search results - page 167 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
150
click to vote
KDD
2008
ACM
16 years 3 months ago
2008
ACM
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
127
click to vote
CIAC
2000
Springer
15 years 7 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
128
click to vote
GI
2004
Springer
15 years 8 months ago
2004
Springer
Abstract: Among other things, Peer-to-Peer (P2P) systems are very useful for managing large amounts of widely distributed data. Distributed Hash Tables (DHT) offer a highly scalabl...
125
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
160
click to vote
TMC
2010
15 years 28 days ago
2010
We explore the use of clock skew of a wireless local area network access point (AP) as its fingerprint to detect unauthorized APs quickly and accurately. The main goal behind usi...