Sciweavers

5084 search results - page 652 / 1017
» Proving Possibility Properties
Sort
View
DCC
2008
IEEE
16 years 6 months ago
A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint....
Eado Meron, Ofer Shayevitz, Meir Feder, Ram Zamir
STOC
2010
ACM
244views Algorithms» more  STOC 2010»
16 years 4 months ago
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
Ryan Williams
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
16 years 4 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
ICDCS
2009
IEEE
16 years 4 months ago
Implementing a Register in a Dynamic Distributed System
Providing distributed processes with concurrent objects is a fundamental service that has to be offered by any distributed system. The classical shared read/write register is one ...
Roberto Baldoni, Silvia Bonomi, Anne-Marie Kermarr...
ALT
2009
Springer
16 years 3 months ago
Iterative Learning from Texts and Counterexamples Using Additional Information
Abstract. A variant of iterative learning in the limit (cf. [LZ96]) is studied when a learner gets negative examples refuting conjectures containing data in excess of the target la...
Sanjay Jain, Efim B. Kinber