2370 search results - page 71 / 474 » The Characterization of Data-Accumulating Algorithms |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this probl...
191
click to vote
AAECC
2011
Springer
14 years 4 months ago
2011
Springer
A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman’s algorithm. Algebra...
111
click to vote
ISAAC
2010
Springer
14 years 7 months ago
2010
Springer
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
100
click to vote
CIAC
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
SIGECOM
2008
ACM
14 years 9 months ago
2008
ACM
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...