909 search results - page 22 / 182 » Performance Evaluation of the VF Graph Matching Algorithm |
125
click to vote
PEWASUN
2004
ACM
15 years 6 months ago
2004
ACM
Interferences in an ad-hoc network can be defined as a set of constraints that specify which groups of nodes cannot transmit simultaneously, and they have significant implications...
144
click to vote
CVPR
2004
IEEE
16 years 3 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
111
click to vote
WWW
2010
ACM
15 years 8 months ago
2010
ACM
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...
133
click to vote
AVSS
2009
IEEE
14 years 11 months ago
2009
IEEE
A novel algorithm for 3D face recognition based point cloud rotations, multiple projections, and voted keypoint matching is proposed and evaluated. The basic idea is to rotate eac...
134
click to vote
SIGMOD
2011
ACM
14 years 4 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...