Sciweavers

43 search results - page 4 / 9
» Matching and edge-connectivity in regular graphs
Sort
View
ICPR
2004
IEEE
14 years 7 months ago
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
Fred W. DePiero
CAPTECH
1998
Springer
13 years 11 months ago
3D Part Recognition Method for Human Motion Analysis
A method for matching sequences from two perspective views of a moving person silhouette is presented. Regular (approximate uniform thickness) parts are detected on an image and a ...
Carlos Yániz, Jairo Rocha, Francisco J. Per...
3DPVT
2004
IEEE
188views Visualization» more  3DPVT 2004»
13 years 10 months ago
3D Shape Registration using Regularized Medial Scaffolds
This paper proposes a novel method for global registration based on matching 3D medial structures of unorganized point clouds or triangulated meshes. Most practical known methods ...
Ming-Ching Chang, Frederic F. Leymarie, Benjamin B...
SIGIR
2011
ACM
12 years 9 months ago
Learning search tasks in queries and web pages via graph regularization
As the Internet grows explosively, search engines play a more and more important role for users in effectively accessing online information. Recently, it has been recognized that ...
Ming Ji, Jun Yan, Siyu Gu, Jiawei Han, Xiaofei He,...
DM
2010
102views more  DM 2010»
13 years 6 months ago
Covering graphs with matchings of fixed size
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
David Cariolaro, Hung-Lin Fu