187 search results - page 9 / 38 » Generic Graph Algorithms for Sparse Matrix Ordering |
WSOM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We show how the “Online Sparse Coding Neural Gas” algorithm can be applied to a more realistic model of the “Cocktail Party Problem”. We consider a setting where ...
WSCG
2001
14 years 10 months ago
2001
In recent years the Hessian matrix and its eigenvalues became important in pattern recognition. Several algorithms based on the information they provide have been introduced. We r...
103
click to vote
INFOCOM
2012
IEEE
12 years 12 months ago
2012
IEEE
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
ALGORITHMS
2010
14 years 6 months ago
2010
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper we develop a probabilistic interpretation and a full Bayesian inference for non-negative matrix deconvolution (NMFD) model. Our ultimate goal is unsupervised extract...