47 search results - page 5 / 10 » And Or Trees Revisited |
GD
2003
Springer
14 years 18 days ago
2003
Springer
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
CHI
2010
ACM
13 years 5 months ago
2010
ACM
Hierarchical structures with large fan-outs are hard to browse and understand. In the conventional node-link tree visualization, the screen quickly becomes overcrowded as users op...
JMLR
2010
13 years 2 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
LREC
2010
13 years 8 months ago
2010
Meanings of morphological categories are an indispensable component of representation of sentence semantics. In the Prague Dependency Treebank 2.0, sentence semantics is represent...
SGAI
2010
Springer
13 years 5 months ago
2010
Springer
The Prism family of algorithms induces modular classification rules which, in contrast to decision tree induction algorithms, do not necessarily fit together into a decision tree s...