The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
The mapping between syntactic structure and prosodic structure is a widely discussed topic in linguistics. In this work we use insights gained from research on syntax-to-prosody m...
—This paper proposes a probabilistic technique that enables a node to estimate the number of its neighbors that fulfill certain criteria. The technique does not require any a pr...
Helmut Adam, Evsen Yanmaz, Wilfried Elmenreich, Ch...
This work models Word Sense Disambiguation (WSD) problem as a Distributed Constraint Optimization Problem (DCOP). To model WSD as a DCOP, we view information from various knowledg...
In order to support interactive high-fidelity prototyping of postWIMP user interactions, we propose a multi-fidelity design method based on a unifying component-based model and su...