33 search results - page 3 / 7 » Alphabetic coding with exponential costs |
ECCC
2010
13 years 6 months ago
2010
We show that it is possible to encode any communication protocol between two parties so that the protocol succeeds even if a (1/4 − ǫ) fraction of all symbols transmitted by th...
PODC
2012
ACM
11 years 10 months ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
KDD
2009
ACM
14 years 2 months ago
2009
ACM
How can we automatically spot all outstanding observations in a data set? This question arises in a large variety of applications, e.g. in economy, biology and medicine. Existing ...
AIRS
2004
Springer
14 years 1 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...