2924 search results - page 233 / 585 » Lower Bounds in Distributed Computing |
127
click to vote
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
143
Voted
SAC
2002
ACM
15 years 3 months ago
2002
ACM
Iterative solvers such as the Jacobi and Gauss-Seidel relaxation methods are important, but time-consuming building blocks of many scientific and engineering applications. The per...
150
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
132
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
135
click to vote
SIAMDM
2002
15 years 3 months ago
2002
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...