187 search results - page 14 / 38 » Generic Graph Algorithms for Sparse Matrix Ordering |
105
click to vote
NIPS
2004
14 years 10 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
ICTAI
2006
IEEE
15 years 3 months ago
2006
IEEE
We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structure...
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
We introduce an algorithm for a non-negative 3D tensor factorization for the purpose of establishing a local parts feature decomposition from an object class of images. In the pas...
APVIS
2008
14 years 11 months ago
2008
We present the Zoomable Adjacency Matrix Explorer (ZAME), a visualization tool for exploring graphs at a scale of millions of nodes and edges. ZAME is based on an adjacency matrix...
ICA
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...