511 search results - page 38 / 103 » The intrinsic dimensionality of graphs |
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
CVPR
2009
IEEE
15 years 5 months ago
2009
IEEE
In this paper, we study the problem of nonnegative graph
embedding, originally investigated in [14] for reaping the
benefits from both nonnegative data factorization and the
spe...
IV
2005
IEEE
14 years 3 months ago
2005
IEEE
Transition systems are graphs and it is natural to consider their visual representation as a graph visualization problem. They also pose an interesting multidimensional visualizat...
GEM
2007
13 years 11 months ago
2007
We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evo...
CVPR
2012
IEEE
12 years 10 days ago
2012
IEEE
The k-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to con...