Sciweavers

1368 search results - page 99 / 274
» Avoiding Simplicity Is Complex
Sort
View
COLING
2008
13 years 11 months ago
Multilingual Alignments by Monolingual String Differences
We propose a method to obtain subsentential alignments from several languages simultaneously. The method handles several languages at once, and avoids the complexity explosion due...
Adrien Lardilleux, Yves Lepage
ESANN
2004
13 years 11 months ago
Flexible and Robust Bayesian Classification by Finite Mixture Models
Abstract. The regularized Mahalanobis distance is proposed in the framework of finite mixture models to avoid commonly faced numerical difficulties encountered with EM. Its princip...
Cédric Archambeau, Frédéric V...
DLOG
1996
13 years 11 months ago
An Approach to Subsumption in a DL with Implication
Designing a DL system poses the problem of the trade-o between power of expression and complexity. In spite of their rich expressive capacity, the or and not constructors are usua...
Mathieu Latourrette, Michel Simonet
ENTCS
2006
213views more  ENTCS 2006»
13 years 10 months ago
Building Components from Functions
In the domain of embedded software systems the increasing complexity of the functionality as well as the increase in variations caused by product lines requires a modular design p...
Bernhard Schäz
LOGCOM
2002
100views more  LOGCOM 2002»
13 years 9 months ago
Model Checking Games for Branching Time Logics
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
Martin Lange, Colin Stirling