290 search results - page 13 / 58 » Local Partitioning for Directed Graphs Using PageRank |
115
click to vote
DCG
2002
15 years 2 months ago
2002
We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretica...
208
click to vote
ICDE
2004
IEEE
16 years 3 months ago
2004
IEEE
XML and other types of semi-structured data are typically represented by a labeled directed graph. To speed up path expression queries over the graph, a variety of structural inde...
ISSS
1997
IEEE
15 years 6 months ago
1997
IEEE
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases . There exists some tools that give an o...
113
Voted
CVPR
2006
IEEE
16 years 4 months ago
2006
IEEE
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
111
click to vote
CGF
1999
15 years 2 months ago
1999
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...