Sciweavers

2570 search results - page 21 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
ACIVS
2009
Springer
14 years 7 months ago
Enhanced Low-Resolution Pruning for Fast Full-Search Template Matching
Abstract. Gharavi-Alkhansari [1] proposed a full-search equivalent algorithm for speeding-up template matching based on Lp-norm distance measures. This algorithm performs a pruning...
Stefano Mattoccia, Federico Tombari, Luigi di Stef...
VC
2011
150views more  VC 2011»
14 years 4 months ago
Weak-perspective structure from motion by fast alternation
Abstract This paper addresses the problem of moving object reconstruction. Several methods have been published in the past 20 years including stereo reconstruction as well as multi...
Levente Hajder, Ákos Pernek, Csaba Kaz&oacu...
IPPS
1997
IEEE
15 years 2 months ago
Fast Parallel Computation of the Polynomial Shift
Given an n-degree polynomial fx over an arbitrary ring, the shift of fx by c is the operation which computes coefficients of the polynomial fx + c. In this paper we conside...
Eugene V. Zima
WABI
2001
Springer
124views Bioinformatics» more  WABI 2001»
15 years 2 months ago
Computing Linking Numbers of a Filtration
We develop fast algorithms for computing the linking number of a simplicial complex within a filtration. We give experimental results in applying our work toward the detection of...
Herbert Edelsbrunner, Afra Zomorodian