10585 search results - page 1882 / 2117 » The Orc Programming Language |
146
click to vote
ICALP
2010
Springer
15 years 8 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 ...
109
click to vote
ICALP
2010
Springer
15 years 8 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...
111
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
The mode of a multiset of labels, is a label that occurs at least as often as any other label. The input to the range mode problem is an array A of size n. A range query [i, j] mus...
155
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
108
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...