Sciweavers

6365 search results - page 253 / 1273
» Fast Local Computation Algorithms
Sort
View
191
Voted
CVPR
2010
IEEE
15 years 10 months ago
Fast pattern matching using orthogonal Haar transform
Pattern matching is a widely used procedure in signal processing, computer vision, image and video processing. Recently, methods using Walsh Hadamard Transform (WHT) and Gray-Code...
Wanli Ouyang, Renqi Zhang, Cham Wai-Kuen
ICPR
2002
IEEE
16 years 7 months ago
A Fast Leading Eigenvector Approximation for Segmentation and Grouping
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
Antonio Robles-Kelly, Sudeep Sarkar, Edwin R. Hanc...
IPPS
2009
IEEE
16 years 1 months ago
Building a parallel pipelined external memory algorithm library
Large and fast hard disks for little money have enabled the processing of huge amounts of data on a single machine. For this purpose, the well-established STXXL library provides a...
Andreas Beckmann, Roman Dementiev, Johannes Single...
IPPS
2006
IEEE
16 years 19 days ago
Parallel implementation of a quartet-based algorithm for phylogenetic analysis
This paper describes a parallel implementation of our recently developed algorithm for phylogenetic analysis on the IBM BlueGene/L cluster [15]. This algorithm constructs evolutio...
Bing Bing Zhou, Daniel Chu, Monther Tarawneh, Ping...
ACCV
2006
Springer
16 years 18 days ago
Fast Global Motion Estimation Via Iterative Least-Square Method
Abstract. This paper presents a fast algorithm for global motion estimation based on Iterative Least- Square Estimation (ILSE) technique. Compared with the traditional framework, t...
Jia Wang, Haifeng Wang, Qingshan Liu, Hanqing Lu