Sciweavers

1176 search results - page 162 / 236
» Sparse reward processes
Sort
View
ICASSP
2011
IEEE
14 years 8 months ago
Improved model-based spectral compressive sensing via nested least squares
This paper introduces a new algorithm for reconstructing signals with sparse spectrums from noisy compressive measurements. The proposed model-based algorithm takes the signal str...
Mahdi Shaghaghi, Sergiy A. Vorobyov
ICASSP
2011
IEEE
14 years 8 months ago
Decentralized support detection of multiple measurement vectors with joint sparsity
This paper considers the problem of finding sparse solutions from multiple measurement vectors (MMVs) with joint sparsity. The solutions share the same sparsity structure, and th...
Qing Ling, Zhi Tian
MOBISYS
2010
ACM
15 years 6 months ago
CrowdSearch: exploiting crowds for accurate real-time image search on mobile phones
Mobile phones are becoming increasingly sophisticated with a rich set of on-board sensors and ubiquitous wireless connectivity. However, the ability to fully exploit the sensing c...
Tingxin Yan, Vikas Kumar, Deepak Ganesan
ECCV
2008
Springer
16 years 6 months ago
Using Multiple Hypotheses to Improve Depth-Maps for Multi-View Stereo
We propose an algorithm to improve the quality of depth-maps used for Multi-View Stereo (MVS). Many existing MVS techniques make use of a two stage approach which estimates depth-m...
Carlos Hernández, George Vogiatzis, Neill D...
KDD
2008
ACM
119views Data Mining» more  KDD 2008»
16 years 4 months ago
SAIL: summation-based incremental learning for information-theoretic clustering
Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...
Junjie Wu, Hui Xiong, Jian Chen