Sciweavers

619 search results - page 15 / 124
» A dynamical systems approach to weighted graph matching
Sort
View
ECIR
2004
Springer
13 years 9 months ago
Identification of Relevant and Novel Sentences Using Reference Corpus
In the novelty task on sentence level, the amount of information used in similarity computation is the major challenging issue. A shallow NLP approach extracts noun and verb featu...
Hsin-Hsi Chen, Ming-Feng Tsai, Ming-Hung Hsu
ISPAN
1999
IEEE
13 years 12 months ago
Evaluation of a Semi-Static Approach to Mapping Dynamic Iterative Tasks onto Heterogeneous Computing Systems
To minimize the execution time of an iterative application in a heterogeneous parallel computing environment, an appropriate mapping scheme is needed for matching and scheduling th...
Yu-Kwong Kwok, Anthony A. Maciejewski, Howard Jay ...
SEMWEB
2007
Springer
14 years 1 months ago
SODA: an OWL-DL based Ontology Matching System
This paper describes SODA a novel ontology alignment method for the OWL-DL format. SODA uses a new approach that consists in computing local and semantic similarities among ontolog...
Sami Zghal, Sadok Ben Yahia, Engelbert Mephu Nguif...
WWW
2006
ACM
14 years 8 months ago
Using graph matching techniques to wrap data from PDF documents
Wrapping is the process of navigating a data source, semiautomatically extracting data and transforming it into a form suitable for data processing applications. There are current...
Tamir Hassan, Robert Baumgartner
EUROPAR
2004
Springer
13 years 11 months ago
Lookahead Scheduling for Reconfigurable GRID Systems
Abstract This paper proposes an approach to continuously optimizing parallel scientific applications with dynamically changing architectures. We achieve this by combining a dynamic...
Jesper Andersson, Morgan Ericsson, Welf Löwe,...