5448 search results - page 1043 / 1090 » Breakpoints and Time in Distributed Computations |
89
Voted
ADHOCNOW
2007
Springer
15 years 6 months ago
2007
Springer
We present a distributed topology control protocol that runs on a d-QUDG for d ≥ 1/ √ 2, and computes a sparse, constant-spanner, both in Euclidean distance and in hop distance...
102
click to vote
CIVR
2007
Springer
15 years 6 months ago
2007
Springer
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
129
Voted
ICS
2007
Tsinghua U.
15 years 6 months ago
2007
Tsinghua U.
Software or hardware data cache prefetching is an efficient way to hide cache miss latency. However effectiveness of the issued prefetches have to be monitored in order to maximi...
102
click to vote
PAM
2007
Springer
15 years 6 months ago
2007
Springer
The DNS root nameservers routinely use anycast in order to improve their service to clients and increase their resilience against various types of failures. We study DNS traffic co...
101
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...