Sciweavers

1391 search results - page 44 / 279
» Optimally Sparse Frames
Sort
View
ICIP
2006
IEEE
16 years 1 months ago
Sparse Image Reconstruction for Partially known Blur Functions
In this paper, we consider the problem of image reconstruction from the noisy blurred version of an original image when the blurring operator is partially known and the original i...
Raviv Raich, Alfred O. Hero
PAA
2008
14 years 11 months ago
A sparse Bayesian approach for joint feature selection and classifier learning
Abstract In this paper we present a new method for Joint Feature Selection and Classifier Learning (JFSCL) using a sparse Bayesian approach. These tasks are performed by optimizing...
Àgata Lapedriza, Santi Seguí, David ...
JACM
2010
111views more  JACM 2010»
14 years 10 months ago
Finding a maximum matching in a sparse random graph in O(n) expected time
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
NIPS
2008
15 years 1 months ago
Differentiable Sparse Coding
Prior work has shown that features which appear to be biologically plausible as well as empirically useful can be found by sparse coding with a prior such as a laplacian (L1) that...
J. Andrew Bagnell, David M. Bradley
JUCS
2007
105views more  JUCS 2007»
14 years 11 months ago
Graded Sparse Graphs and Matroids
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
Audrey Lee, Ileana Streinu, Louis Theran