Sciweavers

422 search results - page 24 / 85
» On combinations of CMA equalizers
Sort
View
RTSS
1996
IEEE
15 years 1 months ago
Reducing the number of clock variables of timed automata
We propose a method for reducing the number of clocks of a timed automaton by combining two algorithms. The first one consists in detecting active clocks, that is, those clocks wh...
Conrado Daws, Sergio Yovine
CADE
1994
Springer
15 years 1 months ago
A Completion-Based Method for Mixed Universal and Rigid E-Unification
We present a completion-based method for handling a new version of E-unification, called "mixed" E-unification, that is a combination of the classical "universal&quo...
Bernhard Beckert
EMNLP
2008
14 years 11 months ago
N-gram Weighting: Reducing Training Data Mismatch in Cross-Domain Language Model Estimation
In domains with insufficient matched training data, language models are often constructed by interpolating component models trained from partially matched corpora. Since the ngram...
Bo-June Paul Hsu, James R. Glass
DELOS
2004
14 years 11 months ago
Towards Collaborative Search in Digital Libraries Using Peer-to-Peer Technology
We consider the problem of collaborative search across a large number of digital libraries and query routing strategies in a peerto-peer (P2P) environment. Both digital libraries a...
Matthias Bender, Sebastian Michel, Christian Zimme...
JFPLC
1998
14 years 11 months ago
DF - a feature constraint system and its extension to a logic concurrent language
Abstract. This paper presents a feature constraint system that, compared with the well-known systems OSF 1] and CFT 5], incorporates several interesting characteristics. The new sy...
Liviu-Virgil Ciortuz