Sciweavers

1236 search results - page 14 / 248
» fast 2010
Sort
View
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
13 years 4 months ago
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eri...
JCSS
2010
105views more  JCSS 2010»
13 years 8 months ago
Fast convolution and Fast Fourier Transform under interval and fuzzy uncertainty
Convolution y(t) = a(t − s) · x(s) ds is one of the main techniques in digital signal processing. A straightforward computation of the convolution y(t) requires O(n2) steps, wh...
Guoqing Liu, Vladik Kreinovich
BMVC
2010
13 years 7 months ago
FAST: Fast Adaptive Silhouette Area based Template Matching
Template matching is a well-proven approach in the area of articulated object tracking. Matching accuracy and computation time of template matching are essential and yet often con...
Daniel Mohr, Gabriel Zachmann
PAMI
2010
222views more  PAMI 2010»
13 years 8 months ago
Fast Algorithm for Walsh Hadamard Transform on Sliding Windows
— This paper proposes a fast algorithm for Walsh Hadamard Transform on sliding windows which can be used to implement pattern matching most efficiently. The computational require...
Wanli Ouyang, Wai-kuen Cham
DLT
2010
13 years 11 months ago
Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm
Abstract. The well-known parsing algorithm for the context-free grammars due to Valiant ("General context-free recognition in less than cubic time", Journal of Computer a...
Alexander Okhotin