14158 search results - page 2594 / 2832 » Generalized switch-setting problems |
139
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
135
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
140
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
125
Voted
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Consider a center possessing a trusted (tamper proof) device that wishes to securely compute a public function over private inputs that are contributed by some network nodes. In ne...
210
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...