968 search results - page 36 / 194 » A faster implementation of APlace |
204
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...
197
Voted
EGH
2011
Springer
14 years 3 months ago
2011
Springer
We present a highly flexible and efficient software pipeline for programmable triangle voxelization. The pipeline, entirely written in CUDA, supports both fully conservative and ...
238
Voted
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
We propose a novel string search algorithm for data stored once and read many times. Our search method combines the sublinear traversal of the record (as in Boyer Moore or Knuth-M...
132
click to vote
ALENEX
2004
15 years 5 months ago
2004
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
143
Voted
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a new GPU-based tensor voting implementation which achieves significant performance improvement over the conventional CPU-based implementation. Although the t...