1007 search results - page 64 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
141
click to vote
SI3D
2010
ACM
15 years 10 months ago
2010
ACM
We propose a Parallel Banding Algorithm (PBA) on the GPU to compute the exact Euclidean Distance Transform (EDT) for a binary image in 2D and higher dimensions. Partitioning the i...
134
click to vote
HIPC
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
118
click to vote
ICDAR
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper we propose a parallel approach for the Kmeans Vector Quantization (VQ) algorithm used in a twostage Hidden Markov Model (HMM)-based system for recognizing handwritte...
183
click to vote
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
We propose to demonstrate EaseDB, the first cache-oblivious query processor for in-memory relational query processing. The cacheoblivious notion from the theory community refers t...
232
click to vote
ICDE
2003
IEEE
16 years 4 months ago
2003
IEEE
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...