244 search results - page 6 / 49 » On-Line Probability, Complexity and Randomness |
SPAA
2010
ACM
13 years 9 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
MEDIAFORENSICS
2010
13 years 10 months ago
2010
In this paper, we consider a low complexity identification system for highly distorted images. The performance of the proposed identification system is analyzed based on the avera...
WDAG
2010
Springer
13 years 7 months ago
2010
Springer
Most people believe that renaming is easy: simply choose a name at random; if more than one process selects the same name, then try again. We highlight the issues that occur when t...
EATCS
1998
13 years 8 months ago
1998
Experiments have shown [2] that we can only memorize images up to a certain complexity level, after which, instead of memorizing the image itself, we, sort of, memorize a probabil...
ICALP
2007
Springer
14 years 3 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...