10633 search results - page 1317 / 2127 » Relating Distributed Objects |
207
Voted
COCO
2005
Springer
16 years 1 months ago
2005
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 ...
200
click to vote
SPAA
2010
ACM
16 years 8 days ago
2010
ACM
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
209
click to vote
HPDC
2000
IEEE
15 years 12 months ago
2000
IEEE
To provide Quality of Service (QoS) guarantee in distributed services, it is necessary to reserve multiple computing and communication resources for each service session. Meanwhile...
212
click to vote
KDD
1998
ACM
15 years 11 months ago
1998
ACM
We consider the problem of aggregation for uncertain and imprecise data. For such data, we define aggregation operators and use them to provide information on properties and patte...
195
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...