10575 search results - page 1802 / 2115 » Programming Languages |
191
click to vote
PLDI
2003
ACM
15 years 12 months ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
190
click to vote
PLDI
2003
ACM
15 years 12 months ago
2003
ACM
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderi...
199
click to vote
ICALP
2010
Springer
15 years 11 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 ...
158
Voted
ICALP
2010
Springer
15 years 11 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...
154
click to vote
ICALP
2010
Springer
15 years 11 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...