5448 search results - page 681 / 1090 » Breakpoints and Time in Distributed Computations |
186
click to vote
IPPS
1996
IEEE
15 years 11 months ago
1996
IEEE
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
151
click to vote
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
Let C be a class of probability distributions over a finite set . A function D : {0, 1}m is a disperser for C with entropy threshold k and error if for any distribution X in C s...
206
click to vote
DEBS
2008
ACM
15 years 8 months ago
2008
ACM
We propose a sensornet programming model based on declarative spatio-temporal constraints on events only, not sensors. Where previous approaches conflate events and sensors becaus...
186
click to vote
CC
2007
Springer
15 years 7 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
197
click to vote
CIKM
2004
Springer
16 years 10 days ago
2004
Springer
Peer-to-peer Data Networks (PDNs) are large-scale, selforganizing, distributed query processing systems. Familiar examples of PDN are peer-to-peer file-sharing networks, which su...