6004 search results - page 337 / 1201 » Parallelizing query optimization |
104
Voted
CIKM
2009
Springer
15 years 5 months ago
2009
Springer
With the development of positioning technologies and the boosting deployment of inexpensive location-aware sensors, large volumes of trajectory data have emerged. However, efficie...
99
Voted
COCO
1989
Springer
15 years 4 months ago
1989
Springer
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
109
Voted
SPIRE
2010
Springer
14 years 11 months ago
2010
Springer
During the last years a great number of Query Performance Prediction methods have been proposed. However, this explosion of prediction method proposals have not been paralleled by ...
84
Voted
TIP
2010
14 years 7 months ago
2010
In this paper, we present a fast algorithm for filling unknown regions in an image using the strategy of exemplarmatching. Unlike the original exemplar-based method using exhaustiv...
89
Voted
IPPS
2010
IEEE
14 years 10 months ago
2010
IEEE
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on multithreaded GPUs using CUDA. Prefix computations on linked structures ...