1538 search results - page 39 / 308 » Spectral Techniques in Graph Algorithms |
PR
2007
13 years 9 months ago
2007
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
CVPR
2010
IEEE
14 years 6 months ago
2010
IEEE
The widespread availability of digital cameras and ubiquitous Internet access have facilitated the creation of massive image collections. These collections can be highly interconn...
CONSTRAINTS
1998
13 years 9 months ago
1998
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
EDBT
2011
ACM
13 years 1 months ago
2011
ACM
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
CVPR
2008
IEEE
15 years 3 days ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...