9176 search results - page 1755 / 1836 » algorithms 2010 |
156
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
118
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We settle the question of tight thresholds for offline cuckoo hashing. The problem can be stated as follows: we have n keys to be hashed into m buckets each capable of holding a s...
143
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
135
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
125
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...