1986 search results - page 119 / 398 » Path Separability of Graphs |
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In the framework of the interactive search in image databases, we are interested in similarity measures able to learn during the search and usable in real-time. Images are represe...
NIPS
2008
13 years 10 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
COLOGNETWENTE
2009
13 years 10 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
TOG
2002
13 years 8 months ago
2002
In this paper we present a novel method for creating realistic, controllable motion. Given a corpus of motion capture data, we automatically construct a directed graph called a mo...
WEBI
2007
Springer
14 years 3 months ago
2007
Springer
The virtual world is comprised of data items related to each other in a variety of contexts. Often such relations can be represented as graphs that evolve over time. Examples incl...