Sciweavers

1798 search results - page 222 / 360
» A Tree for All Seasons
Sort
View
COLING
2000
15 years 7 months ago
Planning texts by constraint satisfaction
A method is de.scribed by which a rhetoricalstructure tree can be realized by a text structure made up of sections, paragraphs, sentences, vertical lists, mid other textual patter...
Richard Power
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 7 months ago
The rectilinear Steiner arborescence problem is NP-complete
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
Weiping Shi, Chen Su
ACL
1989
15 years 7 months ago
Parsing as Natural Deduction
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing m...
Esther König
AHSWN
2010
103views more  AHSWN 2010»
15 years 6 months ago
Efficient Data Retrieving in Distributed Data-streaming Environments
In a potential distributed application, Automobile Tracking System (ATS), automobile location data is continuously generated, kept in a distributed manner. As large amount of traff...
Jinsong Han, Jun Miao, Jizhong Zhao, Jinpeng Huai,...
EJC
2010
15 years 6 months ago
Partitions versus sets: A case of duality
In a recent paper, Amini et al. introduced a general framework to prove duality theorems between tree decompositions and their dual combinatorial object. They unify all known ad-h...
Laurent Lyaudet, Frédéric Mazoit, St...