Sciweavers

588 search results - page 56 / 118
» Computing the Dimension of Linear Subspaces
Sort
View
ICCV
2003
IEEE
14 years 12 months ago
Improved Fast Gauss Transform and Efficient Kernel Density Estimation
Evaluating sums of multivariate Gaussians is a common computational task in computer vision and pattern recognition, including in the general and powerful kernel density estimatio...
Changjiang Yang, Ramani Duraiswami, Nail A. Gumero...
JMLR
2008
133views more  JMLR 2008»
13 years 10 months ago
Algorithms for Sparse Linear Classifiers in the Massive Data Setting
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...
Suhrid Balakrishnan, David Madigan
MP
2006
88views more  MP 2006»
13 years 10 months ago
Bounds on linear PDEs via semidefinite optimization
Using recent progress on moment problems, and their connections with semidefinite optimization, we present in this paper a new methodology based on semidefinite optimization, to ob...
Dimitris Bertsimas, Constantine Caramanis
STOC
2009
ACM
119views Algorithms» more  STOC 2009»
14 years 10 months ago
Explicit construction of a small epsilon-net for linear threshold functions
We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...
Yuval Rabani, Amir Shpilka
TSD
2010
Springer
13 years 7 months ago
Correlation Features and a Linear Transform Specific Reproducing Kernel
Abstract. In this paper we introduce two ideas for phoneme classification: First, we derive the necessary steps to integrate linear transform into the computation of reproducing ke...
Andreas Beschorner, Dietrich Klakow