Sciweavers

3466 search results - page 33 / 694
» Fast computation of special resultants
Sort
View
ICAPR
2009
Springer
14 years 5 months ago
Hierarchical Local Maps for Robust Approximate Nearest Neighbor Computation
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
Pratyush Bhatt, Anoop M. Namboodiri
SAC
2006
ACM
14 years 4 months ago
Improving the compensated Horner scheme with a fused multiply and add
Several different techniques and softwares intend to improve the accuracy of results computed in a fixed finite precision. Here we focus on a method to improve the accuracy of ...
Stef Graillat, Philippe Langlois, Nicolas Louvet
ISM
2008
IEEE
110views Multimedia» more  ISM 2008»
14 years 5 months ago
A Hardware-Independent Fast Logarithm Approximation with Adjustable Accuracy
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
Oriol Vinyals, Gerald Friedland
APCCAS
2006
IEEE
261views Hardware» more  APCCAS 2006»
14 years 28 days ago
A Grouped Fast Fourier Transform Algorithm Design For Selective Transformed Outputs
- In this paper, the grouped scheme is specially applied to compute the fast Fourier transform (FFT) when the portions of transformed outputs are calculated selectively. The groupe...
Chih-Peng Fan, Guo-An Su
EWCBR
2004
Springer
14 years 4 months ago
Case-Based Object Recognition
Model-based object recognition is a well-known task in Computer Vision. Usually, one object that can be generalized by a model should be detected in an image based on this model. B...
Petra Perner, Angela Bühring