187 search results - page 15 / 38 » Generic Graph Algorithms for Sparse Matrix Ordering |
111
click to vote
KDD
2012
ACM
12 years 12 months ago
2012
ACM
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
118
Voted
CVPR
2012
IEEE
12 years 12 months ago
2012
IEEE
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
SIGIR
2005
ACM
15 years 3 months ago
2005
ACM
In this paper we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous data objects (e.g., web pages, queries) and their interrelationships (e.g., hyperlinks...
76
Voted
WEA
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
DATE
2007
IEEE
15 years 3 months ago
2007
IEEE
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...