Sciweavers

2695 search results - page 108 / 539
» Learning Graph Matching
Sort
View
130
Voted
BIS
2008
119views Business» more  BIS 2008»
15 years 4 months ago
Fuzzy Constraint-based Schema Matching Formulation
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
Alsayed Algergawy, Eike Schallehn, Gunter Saake
ICCV
2005
IEEE
16 years 4 months ago
The Pyramid Match Kernel: Discriminative Classification with Sets of Image Features
Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernel-based classification m...
Kristen Grauman, Trevor Darrell
139
Voted
FQAS
2009
Springer
127views Database» more  FQAS 2009»
15 years 9 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
ICARCV
2002
IEEE
126views Robotics» more  ICARCV 2002»
15 years 7 months ago
Gesture recognition using a probabilistic framework for pose matching
This paper presents an approach for view-based recognition of gestures. The approach is based on representing each gesture as a sequence of learned body poses. The gestures are re...
Ahmed M. Elgammal, Vhay Shet, Yaser Yacoob, Larry ...
JCT
2006
102views more  JCT 2006»
15 years 2 months ago
Minimal bricks
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletio...
Serguei Norine, Robin Thomas