6437 search results - page 978 / 1288 » Parallel Algorithms for Arrangements |
251
click to vote
PDIS
1996
IEEE
15 years 10 months ago
1996
IEEE
Users today are struggling to integrate a broad range of information sources providing di erent levels of query capabilities. Currently, data sources with di erent and limitedcapa...
161
click to vote
IPPS
1994
IEEE
15 years 10 months ago
1994
IEEE
AVL trees with relaxed balance were introduced with the aim of improving runtime performance by allowing a greater degree of concurrency. This is obtained by uncoupling updating f...
168
click to vote
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
152
click to vote
SPAA
1990
ACM
15 years 10 months ago
1990
ACM
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
201
click to vote
BIBE
2007
IEEE
15 years 10 months ago
2007
IEEE
The computational power and memory bandwidth of graphics processing units (GPUs) have turned them into attractive platforms for general-purpose applications. In this paper, we expl...