Sciweavers

292 search results - page 34 / 59
» A decentralized algorithm for spectral analysis
Sort
View
FTML
2010
159views more  FTML 2010»
13 years 7 months ago
Dimension Reduction: A Guided Tour
We give a tutorial overview of several geometric methods for dimension reduction. We divide the methods into projective methods and methods that model the manifold on which the da...
Christopher J. C. Burges
ICML
2006
IEEE
14 years 9 months ago
Discriminative cluster analysis
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
Fernando De la Torre, Takeo Kanade
ICC
2011
IEEE
219views Communications» more  ICC 2011»
12 years 8 months ago
Deterministic Equivalents for the Performance Analysis of Isometric Random Precoded Systems
—We consider a general wireless channel model for different types of code-division multiple access (CDMA) and space-division multiple-access (SDMA) systems with isometric random ...
Jakob Hoydis, Romain Couillet, Mérouane Deb...
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
14 years 9 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 9 months ago
Optimally Sparse Frames
Frames have established themselves as a means to derive redundant, yet stable decompositions of a signal for analysis or transmission, while also promoting sparse expansions. Howe...
Peter G. Casazza, Andreas Heinecke, Felix Krahmer,...