Sciweavers

33 search results - page 4 / 7
» Stable sparse approximations via nonconvex optimization
Sort
View
ESA
2006
Springer
139views Algorithms» more  ESA 2006»
13 years 11 months ago
Stochastic Shortest Paths Via Quasi-convex Maximization
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...
ICIP
2010
IEEE
13 years 5 months ago
Image modeling and enhancement via structured sparse model selection
An image representation framework based on structured sparse model selection is introduced in this work. The corresponding modeling dictionary is comprised of a family of learned ...
Guoshen Yu, Guillermo Sapiro, Stéphane Mall...
CISS
2008
IEEE
14 years 2 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 8 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
ICMLA
2009
13 years 5 months ago
Transformation Learning Via Kernel Alignment
This article proposes an algorithm to automatically learn useful transformations of data to improve accuracy in supervised classification tasks. These transformations take the for...
Andrew Howard, Tony Jebara