Sciweavers

115 search results - page 7 / 23
» Fast approximate spectral clustering
Sort
View
98
Voted
SIAMMAX
2010
116views more  SIAMMAX 2010»
14 years 7 months ago
Acquired Clustering Properties and Solution of Certain Saddle Point Systems
Many mathematical models involve flow equations characterized by nonconstant viscosity, and a Stokes type problem with variable viscosity coefficient arises. Appropriate block diag...
M. A. Olshanskii, V. Simoncini
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
15 years 6 months ago
Separating Populations with Wide Data: A Spectral Analysis
In this paper, we consider the problem of partitioning a small data sample drawn from a mixture of k product distributions. We are interested in the case that individual features a...
Avrim Blum, Amin Coja-Oghlan, Alan M. Frieze, Shuh...
SIGPRO
2010
122views more  SIGPRO 2010»
14 years 10 months ago
Parameter estimation for exponential sums by approximate Prony method
The recovery of signal parameters from noisy sampled data is a fundamental problem in digital signal processing. In this paper, we consider the following spectral analysis problem...
Daniel Potts, Manfred Tasche
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 1 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
CVPR
2005
IEEE
16 years 2 months ago
A Tensor Decomposition for Geometric Grouping and Segmentation
While spectral clustering has been applied successfully to problems in computer vision, their applicability is limited to pairwise similarity measures that form a probability matr...
Venu Madhav Govindu