17049 search results - page 386 / 3410 » cans 2007 |
157
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The Boolean satisfiability problem (SAT) can be solved efficiently with variants of the DPLL algorithm. For industrial SAT problems, DPLL with conflict analysis depend...
170
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Usually, mathematical objects have highly parallel interpretations. In this paper, we consider them as sequential constructors of other objects. In particular, we prove t...
195
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The aim of this paper is to show how we can handle the Recognising Textual Entailment (RTE) task by using Description Logics (DLs). To do this, we propose a representation of natur...
147
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We define a class of “algebraic” random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate th...
163
click to vote
CSDA
2007
15 years 6 months ago
2007
Finite mixtures of parametric distributions are often used to model data of which it is known or suspected that there are subpopulations. Instead of a parametric model, a penalize...