Sciweavers

280 search results - page 28 / 56
» Approximate nearest neighbors using sparse representations
Sort
View
NIPS
2004
14 years 11 months ago
A Direct Formulation for Sparse PCA Using Semidefinite Programming
We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its...
Alexandre d'Aspremont, Laurent El Ghaoui, Michael ...
NIPS
2003
14 years 11 months ago
Perspectives on Sparse Bayesian Learning
Recently, relevance vector machines (RVM) have been fashioned from a sparse Bayesian learning (SBL) framework to perform supervised learning using a weight prior that encourages s...
David P. Wipf, Jason A. Palmer, Bhaskar D. Rao
107
Voted
CGF
2010
157views more  CGF 2010»
14 years 7 months ago
Non-iterative Second-order Approximation of Signed Distance Functions for Any Isosurface Representation
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
Vladimir Molchanov, Paul Rosenthal, Lars Linsen
CORR
2008
Springer
106views Education» more  CORR 2008»
14 years 9 months ago
Quantization of Prior Probabilities for Hypothesis Testing
Abstract--In this paper, Bayesian hypothesis testing is investigated when the prior probabilities of the hypotheses, taken as a random vector, are quantized. Nearest neighbor and c...
Kush R. Varshney, Lav R. Varshney
CVPR
2007
IEEE
15 years 11 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell