Sciweavers

909 search results - page 29 / 182
» Performance Evaluation of the VF Graph Matching Algorithm
Sort
View
IPPS
1998
IEEE
15 years 5 months ago
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
Yu-Kwong Kwok, Ishfaq Ahmad
EKAW
2008
Springer
15 years 3 months ago
Towards a Rule-Based Matcher Selection
Abstract. The central problems w.r.t. interoperability and data integration issues in the Semantic Web are schema and ontology matching approaches. Today it takes an expert to dete...
Malgorzata Mochol, Anja Jentzsch
CVPR
2011
IEEE
14 years 9 months ago
2D Nonrigid Partial Shape Matching Using MCMC and Contour Subdivision
Shape matching has many applications in computer vision, such as shape classification, object recognition, object detection, and localization. In 2D cases, shape instances are 2D c...
Y. Cao, Z. Zhang, I. Czogiel, I. Dryden, S. Wang
KCAP
2003
ACM
15 years 6 months ago
Using transformations to improve semantic matching
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...
Peter Z. Yeh, Bruce W. Porter, Ken Barker
ICRA
2009
IEEE
148views Robotics» more  ICRA 2009»
15 years 8 months ago
Graph-based robust shape matching for robotic application
— Shape is one of the useful information for object detection. The human visual system can often recognize objects based on the 2-D outline shape alone. In this paper, we address...
Hanbyul Joo, Yekeun Jeong, Olivier Duchenne, Seong...