Sciweavers

4137 search results - page 145 / 828
» On the number of matchings of a tree
Sort
View
ICCV
2007
IEEE
16 years 25 days ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
WSCG
2004
139views more  WSCG 2004»
15 years 7 months ago
Objects Matching Improvement Using Optimization Techniques in a Geometric Modal Methodology
This work was based on a previously developed methodology using shape modal description for matching image objects. With this methodology, the objects points were matched using a ...
Luísa Ferreira Bastos, João Manuel R...
EMNLP
2009
15 years 4 months ago
Fast Translation Rule Matching for Syntax-based Statistical Machine Translation
In a linguistically-motivated syntax-based translation system, the entire translation process is normally carried out in two steps, translation rule matching and target sentence d...
Hui Zhang, Min Zhang, Haizhou Li, Chew Lim Tan
ICSOC
2009
Springer
15 years 4 months ago
Towards Ontology Matching for Intelligent Gadgets
The FAST gadget development environment allows users to graphically compose intelligent, i.e., semantically annotated gadgets from predefined building blocks and deploy them on var...
Oszkar Ambrus, Knud Möller, Siegfried Handsch...
ICML
2004
IEEE
15 years 12 months ago
Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
Hisashi Kashima, Yuta Tsuboi