Sciweavers

1381 search results - page 120 / 277
» Fast Filtered Sampling
Sort
View
173
Voted
NIPS
2008
15 years 4 months ago
QUIC-SVD: Fast SVD Using Cosine Trees
The Singular Value Decomposition is a key operation in many machine learning methods. Its computational cost, however, makes it unscalable and impractical for applications involvi...
Michael P. Holmes, Alexander G. Gray, Charles Lee ...
ICVGIP
2004
15 years 4 months ago
Fast and Robust Projective Matching for Fingerprints Using Geometric Hashing
Fingerprint matching is the most important module in automatic person recognition using fingerprints. We model the nonlinear distortions and noise obtained during the fingerprint ...
Rintu Boro, Sumantra Dutta Roy
119
Voted
ECAI
2010
Springer
15 years 3 months ago
A Very Fast Method for Clustering Big Text Datasets
Large-scale text datasets have long eluded a family of particularly elegant and effective clustering methods that exploits the power of pair-wise similarities between data points ...
Frank Lin, William W. Cohen
107
Voted
ICIP
2005
IEEE
16 years 4 months ago
Fast trifocal tensor estimation using virtual parallax
We present a computationally efficient method for estimating the trifocal tensor corresponding to three images acquired by a freely moving camera. The proposed method represents p...
Manolis I. A. Lourakis, Antonis A. Argyros
144
Voted
ICPR
2006
IEEE
16 years 3 months ago
Fast Support Vector Machine Classification using linear SVMs
We propose a classification method based on a decision tree whose nodes consist of linear Support Vector Machines (SVMs). Each node defines a decision hyperplane that classifies p...
Karina Zapien Arreola, Janis Fehr, Hans Burkhardt