24 search results - page 3 / 5 » Separating Deterministic from Randomized Multiparty Communic... |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Abstract-- The capacity of a class of deterministic relay channels with the transmitter input X, the receiver output Y , the relay output Y1 = f(X, Y ), and a separate communicatio...
ALT
2007
Springer
14 years 2 months ago
2007
Springer
In this paper, we address the issue of learning nonlinearly separable concepts with a kernel classifier in the situation where the data at hand are altered by a uniform classific...
COCO
2009
Springer
13 years 12 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
ICDCS
2010
IEEE
13 years 9 months ago
2010
IEEE
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
APPROX
2011
Springer
12 years 5 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...