5448 search results - page 556 / 1090 » Breakpoints and Time in Distributed Computations |
180
Voted
SPAA
1995
ACM
15 years 10 months ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
186
Voted
IMC
2009
ACM
16 years 1 months ago
2009
ACM
Triangle inequality violations (TIVs) are important for latency sensitive distributed applications. On one hand, they can expose opportunities to improve network routing by findi...
233
click to vote
PODC
2006
ACM
16 years 1 months ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
180
Voted
FOCS
2002
IEEE
16 years 2 days ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
176
click to vote
SMA
2003
ACM
16 years 11 days ago
2003
ACM
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...