187 search results - page 13 / 38 » Generic Graph Algorithms for Sparse Matrix Ordering |
TCS
2008
14 years 9 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
132
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In the past decade there has been a great interest in a synthesis-based model for signals, based on sparse and redundant representations. Such a model assumes that the signal of i...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Attributed graphs are increasingly more common in many application domains such as chemistry, biology and text processing. A central issue in graph mining is how to collect inform...
ICASSP
2010
IEEE
14 years 7 months ago
2010
IEEE
In this paper, we propose a new method of blind source separation (BSS) for music signals. Our method has the following characteristics: 1) the method is a combination of the spar...
ICDM
2008
IEEE
15 years 3 months ago
2008
IEEE
Recently Non-negative Matrix Factorization (NMF) has received a lot of attentions in information retrieval, computer vision and pattern recognition. NMF aims to find two non-nega...