Sciweavers

30 search results - page 1 / 6
» Matrix Coherence and the Nystrom Method
Sort
View
CORR
2010
Springer
60views Education» more  CORR 2010»
13 years 4 months ago
Matrix Coherence and the Nystrom Method
Ameet Talwalkar, Afshin Rostamizadeh
IGARSS
2009
13 years 3 months ago
Estimation and Segmentation in Non-Gaussian POLSAR Clutter by SIRV Stochastic Processes
In the context of non-Gaussian polarimetric clutter models, this paper presents an application of the recent advances in the field of Spherically Invariant Random Vectors (SIRV) m...
Gabriel Vasile, Jean Philippe Ovarlez, Fréd...
BMCBI
2008
138views more  BMCBI 2008»
13 years 5 months ago
Methods for simultaneously identifying coherent local clusters with smooth global patterns in gene expression profiles
Background: The hierarchical clustering tree (HCT) with a dendrogram [1] and the singular value decomposition (SVD) with a dimension-reduced representative map [2] are popular met...
Yin-Jing Tien, Yun-Shien Lee, Han-Ming Wu, Chun-Ho...
ICML
2009
IEEE
14 years 6 months ago
On sampling-based approximate spectral decomposition
This paper addresses the problem of approximate singular value decomposition of large dense matrices that arises naturally in many machine learning applications. We discuss two re...
Sanjiv Kumar, Mehryar Mohri, Ameet Talwalkar
CORR
2010
Springer
225views Education» more  CORR 2010»
13 years 5 months ago
Sensing Matrix Optimization for Block-Sparse Decoding
Recent work has demonstrated that using a carefully designed sensing matrix rather than a random one, can improve the performance of compressed sensing. In particular, a welldesign...
Kevin Rosenblum, Lihi Zelnik-Manor, Yonina C. Elda...