363 search results - page 8 / 73 » Partial Multicuts in Trees |
KDD
2009
ACM
14 years 9 months ago
2009
ACM
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
ENTCS
2006
13 years 8 months ago
2006
Motivated by the concerns of theorem-proving, we generalise the notion of proof tree to that of hierarchical proof tree. Hierarchical trees extend ordinary trees by adding partial...
ACIVS
2008
Springer
14 years 2 months ago
2008
Springer
The paper proposes a new parallel connected-component-tree construction algorithm based on line independent building and progressive merging of partial 1-D trees. Two parallelizati...
IJCNLP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Partial parsing techniques try to recover syntactic information efficiently and reliably by sacrificing completeness and depth of analysis. One of the difficulties of pa...
DAGSTUHL
1996
13 years 10 months ago
1996
Recently, considerable advances have been made in the (on-line) control of logic program specialisation. A clear conceptual distinction has been established between local and glob...