363 search results - page 7 / 73 » Partial Multicuts in Trees |
COMCOM
1998
13 years 8 months ago
1998
With the proliferation of multimedia group applications, the construction of multicast trees satisfying Quality of Service QoS requirements is becoming a problem of prime import...
ACL
2012
11 years 11 months ago
2012
We propose a new approach to characterizing the timeline of a text: temporal dependency structures, where all the events of a narrative are linked via partial ordering relations l...
NLPRS
2001
Springer
14 years 1 months ago
2001
Springer
In this paper, we propose a hierarchical phrase alignment method that aims to acquire translation knowledge. Previous methods utilize the correspondence of sub-trees between bilin...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
AI
2007
Springer
13 years 8 months ago
2007
Springer
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...