363 search results - page 34 / 73 » Partial Multicuts in Trees |
LICS
2005
IEEE
14 years 3 months ago
2005
IEEE
We propose L-nets as a game model of concurrent interaction. L-nets, which correspond to strategies (in Games Semantics) or designs (in Ludics), are graphs rather than trees; the ...
ACL
2008
13 years 11 months ago
2008
Underspecification-based algorithms for processing partially disambiguated discourse structure must cope with extremely high numbers of readings. Based on previous work on dominan...
ACL
2009
13 years 7 months ago
2009
This paper describes an incremental parser based on an adjoining operation. By using the operation, we can avoid the problem of infinite local ambiguity in incremental parsing. Th...
CLASSIFICATION
2006
13 years 10 months ago
2006
Abstract. Given a set of pairwise distances on a set of n points, constructing an edge-weighted tree whose leaves are these n points such that the tree distances would mimic the or...
CTRSA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...