Sciweavers

561 search results - page 53 / 113
» Algorithms and applications for approximate nonnegative matr...
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Infinite-state spectrum model for music signal analysis
This paper presents a nonparametric Bayesian extension of nonnegative matrix factorization (NMF) for music signal analysis. Instrument sounds often exhibit non-stationary spectral...
Masahiro Nakano, Jonathan Le Roux, Hirokazu Kameok...
ALT
2009
Springer
14 years 4 months ago
Approximation Algorithms for Tensor Clustering
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
Stefanie Jegelka, Suvrit Sra, Arindam Banerjee
WAOA
2005
Springer
112views Algorithms» more  WAOA 2005»
14 years 1 months ago
Partial Multicuts in Trees
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
Asaf Levin, Danny Segev
TOMS
2011
101views more  TOMS 2011»
13 years 2 months ago
Partitioned Triangular Tridiagonalization
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...
Miroslav Rozlozník, Gil Shklarski, Sivan To...
PODS
2008
ACM
153views Database» more  PODS 2008»
14 years 7 months ago
Approximation algorithms for co-clustering
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar