Sciweavers

711 search results - page 33 / 143
» Matching Hierarchical Structures Using Association Graphs
Sort
View
148
Voted
CVPR
2011
IEEE
14 years 10 months ago
Scale and Rotation Invariant Matching Using Linearly Augmented Trees
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...
Hao Jiang, Tai-Peng Tian, Stan Sclaroff
125
Voted
ICMT
2009
Springer
15 years 8 months ago
A Collection Operator for Graph Transformation
Abstract. Graph transformation has a well-established theory and associated tools that can be used to perform model transformations. However, the lack of a construct to match and t...
Roy Grønmo, Stein Krogdahl, Birger Mø...
131
Voted
ICCS
1994
Springer
15 years 6 months ago
UDS: A Universal Data Structure
This paper gives a data structure (UDS) for supporting database retrieval, inference and machine learning that attempts to unify and extend previous work in relational databases, ...
Robert Levinson
122
Voted
NIPS
2001
15 years 3 months ago
Matching Free Trees with Replicator Equations
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
Marcello Pelillo
129
Voted
TSE
2010
148views more  TSE 2010»
15 years 17 days ago
Program Behavior Discovery and Verification: A Graph Grammar Approach
—Discovering program behaviors and functionalities can ease program comprehension and verification. Existing program analysis approaches have used text mining algorithms to infer...
Chunying Zhao, Jun Kong, Kang Zhang