Sciweavers

909 search results - page 10 / 182
» Performance Evaluation of the VF Graph Matching Algorithm
Sort
View
SEMWEB
2007
Springer
14 years 1 months ago
Structure Preserving Semantic Matching
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...
CJ
2008
110views more  CJ 2008»
13 years 7 months ago
Average-Case Performance Analysis Of Online Non-Clairvoyant Scheduling Of Parallel Tasks With Precedence Constraints
We evaluate the average-case performance of three approximation algorithms for online non-clairvoyant scheduling of parallel tasks with precedence constraints. We show that for a ...
Keqin Li
CVPR
2004
IEEE
14 years 9 months ago
Segment-Based Stereo Matching Using Graph Cuts
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
Li Hong, George Chen
IJDAR
2006
245views more  IJDAR 2006»
13 years 7 months ago
Object count/area graphs for the evaluation of object detection and segmentation algorithms
Evaluation of object detection algorithms is a non-trivial task: a detection result is usually evaluated by comparing the bounding box of the detected object with the bounding box...
Christian Wolf, Jean-Michel Jolion
ICCAD
2008
IEEE
150views Hardware» more  ICCAD 2008»
14 years 4 months ago
Performance estimation and slack matching for pipelined asynchronous architectures with choice
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
Gennette Gill, Vishal Gupta, Montek Singh