Sciweavers

599 search results - page 98 / 120
» The repeater tree construction problem
Sort
View
ECAI
1998
Springer
15 years 1 months ago
The Neural Path to Dialogue Acts
This paper presents a neural network approach to the problem of nding the dialogue act for a given utterance. So far only symbolic, decision tree and statistical approaches were ut...
M. Kipp
DLOG
2007
14 years 12 months ago
Blocking Automata for PSPACE DLs
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
Franz Baader, Jan Hladik, Rafael Peñaloza
IFIP12
2008
14 years 11 months ago
P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
Frederic T. Stahl, Max A. Bramer, Mo Adda
NIPS
2004
14 years 11 months ago
Expectation Consistent Free Energies for Approximate Inference
We propose a novel a framework for deriving approximations for intractable probabilistic models. This framework is based on a free energy (negative log marginal likelihood) and ca...
Manfred Opper, Ole Winther
BIB
2008
86views more  BIB 2008»
14 years 9 months ago
Recent developments in the MAFFT multiple sequence alignment program
The accuracy and scalability of multiple sequence alignment (MSA) of DNAs and proteins have long been and are still important issues in bioinformatics. To rapidly construct a reas...
Kazutaka Katoh, Hiroyuki Toh