Sciweavers

1385 search results - page 155 / 277
» Clustering by Random Projections
Sort
View
ICASSP
2010
IEEE
15 years 6 months ago
Distance-based discretization of parametric signal manifolds
The characterization of signals and images in manifolds often lead to efficient dimensionality reduction algorithms based on manifold distance computation for analysis or classi...
Elif Vural, Pascal Frossard
ICPR
2010
IEEE
15 years 3 months ago
Beyond "Near Duplicates": Learning Hash Codes for Efficient Similar-Image Retrieval
Finding similar images in a large database is an important, but often computationally expensive, task. In this paper, we present a two-tier similar-image retrieval system with the...
Shumeet Baluja, Michele Covell
CORR
2011
Springer
148views Education» more  CORR 2011»
15 years 1 months ago
How well can we estimate a sparse vector?
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...
Emmanuel J. Candès, Mark A. Davenport
JMLR
2010
158views more  JMLR 2010»
15 years 1 months ago
Topology Selection in Graphical Models of Autoregressive Processes
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
Jitkomut Songsiri, Lieven Vandenberghe
SODA
2012
ACM
268views Algorithms» more  SODA 2012»
13 years 9 months ago
Analyzing graph structure via linear measurements
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
Kook Jin Ahn, Sudipto Guha, Andrew McGregor