656 search results - page 72 / 132 » Marrying Words and Trees |
SAS
1999
Springer
15 years 4 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
102
click to vote
LREC
2010
15 years 1 months ago
2010
This paper investigates the mapping between two semantic formalisms, namely the tectogrammatical layer of the Prague Dependency Treebank 2.0 (PDT) and (Robust) Minimal Recursion S...
CIIT
2004
15 years 1 months ago
2004
New applications emerge along with the rapid growth of the Internet. Many functionalities other than packet forwarding are being proposed to be added into routers for supporting t...
IJCAI
2003
15 years 1 months ago
2003
Unlike conventional data or text, Web pages typically contain a large amount of information that is not part of the main contents of the pages, e.g., banner ads, navigation bars, ...
106
click to vote
DAM
2010
14 years 12 months ago
2010
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...