5448 search results - page 650 / 1090 » Breakpoints and Time in Distributed Computations |
189
click to vote
SPAA
1997
ACM
15 years 11 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
178
click to vote
PODC
2010
ACM
15 years 11 months ago
2010
ACM
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with...
192
click to vote
SWAT
2000
Springer
15 years 10 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
228
click to vote
DIS
2006
Springer
15 years 9 months ago
2006
Springer
Knowledge discovery systems are constrained by three main limited resources: time, memory and sample size. Sample size is traditionally the dominant limitation, but in many present...
226
click to vote
ICDCS
2011
IEEE
14 years 6 months ago
2011
IEEE
Abstract—Intentional interference constitutes a major threat for communication networks operating over a shared medium where availability is imperative. Jamming attacks are often...