583 search results - page 30 / 117 » Efficient algorithms for constructing decision trees with co... |
FROCOS
2009
Springer
15 years 1 months ago
2009
Springer
In recent years, the problem of extracting a MUS (Minimal Unsatisfiable Subformula) from an unsatisfiable CNF has received much attention. Indeed, when a Boolean formula is proved ...
ACL
1997
14 years 11 months ago
1997
We present an algorithm for simultaneously constructing both the syntax and semantics of a sentence using a Lexicalized Tree Adjoining Grammar (LTAG). This approach captures natur...
ICCNMC
2005
Springer
15 years 3 months ago
2005
Springer
This paper proposes a set of novel multicast algorithms for m-D mesh overlay networks that can achieve shorter multicast delay and less resource consumptions. In contrast to previo...
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
IJCAI
1997
14 years 11 months ago
1997
Windowing has been proposed as a procedure for efficient memory use in the ID3 decision tree learning algorithm. However, it was shown that it may often lead to a decrease in perf...