4541 search results - page 181 / 909 » Cache-Oblivious Algorithms and Data Structures |
200
click to vote
PPOPP
2011
ACM
14 years 6 months ago
2011
ACM
The queue data structure is fundamental and ubiquitous. Lockfree versions of the queue are well known. However, an important open question is whether practical wait-free queues ex...
129
click to vote
SDM
2009
SIAM
16 years 11 days ago
2009
SIAM
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
150
click to vote
COMGEO
1999
ACM
15 years 2 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
119
click to vote
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
119
click to vote
COCOON
1999
Springer
15 years 7 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...