Sciweavers

932 search results - page 105 / 187
» Hierarchical graph indexing
Sort
View
WIOPT
2010
IEEE
15 years 4 months ago
K-shell decomposition for dynamic complex networks
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
Daniele Miorandi, Francesco De Pellegrini
ICCV
2007
IEEE
16 years 8 months ago
Graph Based Discriminative Learning for Robust and Efficient Object Tracking
Object tracking is viewed as a two-class 'one-versusrest' classification problem, in which the sample distribution of the target is approximately Gaussian while the back...
Xiaoqin Zhang, Weiming Hu, Stephen J. Maybank, Xi ...
ICPR
2000
IEEE
16 years 7 months ago
Attributed Tree Homomorphism Using Association Graphs
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
Massimo Bartoli, Marcello Pelillo, Kaleem Siddiqi,...
INFOVIS
1997
IEEE
15 years 10 months ago
H3: laying out large directed graphs in 3D hyperbolic space
We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using ...
Tamara Munzner
AIPS
2000
15 years 7 months ago
New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by prop...
Amnon Lotem, Dana S. Nau