Sciweavers

276 search results - page 10 / 56
» Constraint Propagation as a Proof System
Sort
View
CADE
2004
Springer
14 years 1 months ago
Improved Modular Termination Proofs Using Dependency Pairs
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
René Thiemann, Jürgen Giesl, Peter Sch...
EMNLP
2009
13 years 5 months ago
Multilingual Spectral Clustering Using Document Similarity Propagation
We present a novel approach for multilingual document clustering using only comparable corpora to achieve cross-lingual semantic interoperability. The method models document colle...
Dani Yogatama, Kumiko Tanaka-Ishii
ICRA
2002
IEEE
114views Robotics» more  ICRA 2002»
14 years 17 days ago
On Mechanical Control Systems with Nonholonomic Constraints and Symmetries
This paper presents a computationally efficient method for deriving coordinate representations for the equations of motion and the affine connection describing a class of Lagrangi...
Francesco Bullo, Milos Zefran
ARTMED
2006
70views more  ARTMED 2006»
13 years 7 months ago
Towards a comprehensive treatment of repetitions, periodicity and temporal constraints in clinical guidelines
Temporal constraints play a fundamental role in clinical guidelines. For example, temporal indeterminacy, constraints about duration, delays between actions, and periodic repetiti...
Luca Anselma, Paolo Terenziani, Stefania Montani, ...
IJCAI
1997
13 years 9 months ago
Computational Complexity of Multi-way, Dataflow Constraint Problems
Although it is acknowledged that multi-way dataflow constraints are useful in interactive applications, concerns about their tractability have hindered their acceptance. Certain l...
Gilles Trombettoni, Bertrand Neveu