Sciweavers

2069 search results - page 193 / 414
» Linear time algorithms for Clobber
Sort
View
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 6 months ago
Sublinear Optimization for Machine Learning
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
ISCI
2007
141views more  ISCI 2007»
15 years 6 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
IPCV
2008
15 years 8 months ago
Face Recognition using PCA and LDA with Singular Value Decomposition (SVD)
Linear Discriminant Analysis(LDA) is well-known scheme for feature extraction and dimension reduction. It has been used widely in many applications involving high-dimensional data,...
Neeta Nain, Nitish Agarwal, Prashant Gour, Rakesh ...
ESANN
2004
15 years 8 months ago
Robust overcomplete matrix recovery for sparse sources using a generalized Hough transform
We propose an algorithm for recovering the matrix A in X = AS where X is a random vector of lower dimension than S. S is assumed to be sparse in the sense that S has less nonzero e...
Fabian J. Theis, Pando G. Georgiev, Andrzej Cichoc...
ICPR
2008
IEEE
16 years 7 months ago
Feature selection focused within error clusters
We propose a feature selection method that constructs each new feature by analysis of tight error clusters. This is a greedy, time-efficient forward selection algorithm that itera...
Henry S. Baird, Sui-Yu Wang