6740 search results - page 1241 / 1348 » Using Classification as a Programming Language |
120
click to vote
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
TGC
2005
Springer
15 years 7 months ago
2005
Springer
Dynamic rebinding is the ability of changing the definitions of names at execution time. While dynamic rebinding is clearly useful in practice, and increasingly needed in modern s...
111
click to vote
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
110
click to vote
ICLP
2004
Springer
15 years 7 months ago
2004
Springer
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
102
click to vote
IFIP
2004
Springer
15 years 7 months ago
2004
Springer
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...