Sciweavers

2783 search results - page 283 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
FOSSACS
2004
Springer
15 years 7 months ago
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
Hartmut Ehrig, Barbara König
IJCNLP
2004
Springer
15 years 7 months ago
Combining Labeled and Unlabeled Data for Learning Cross-Document Structural Relationships
Multi-document discourse analysis has emerged with the potential of improving various NLP applications. Based on the newly proposed Cross-document Structure Theory (CST), this pap...
Zhu Zhang, Dragomir R. Radev
KR
2004
Springer
15 years 7 months ago
Improving the Forward Chaining Algorithm for Conceptual Graphs Rules
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
Jean-François Baget
SCVMA
2004
Springer
15 years 7 months ago
Motion Detection Using Wavelet Analysis and Hierarchical Markov Models
This paper deals with the motion detection problem. This issue is of key importance in many application fields. To solve this problem, we compute the dominant motion in the sequen...
Cédric Demonceaux, Djemâa Kachi-Akkou...
SWAT
2004
Springer
129views Algorithms» more  SWAT 2004»
15 years 7 months ago
Online Scheduling of Splittable Tasks in Peer-to-Peer Networks
We consider online scheduling of splittable tasks on parallel machines. In our model, each task can be split into a limited number of parts, that can then be scheduled independentl...
Leah Epstein, Rob van Stee