Sciweavers

773 search results - page 100 / 155
» Suffix Trees on Words
Sort
View
NAACL
2010
14 years 9 months ago
An extractive supervised two-stage method for sentence compression
We present a new method that compresses sentences by removing words. In a first stage, it generates candidate compressions by removing branches from the source sentence's dep...
Dimitrios Galanis, Ion Androutsopoulos
ICPR
2000
IEEE
16 years 28 days ago
Snakes and Spiders
We consider di usion processes on a class of R trees. The processes are de ned in a manner similar to that of Le Gall's Brownian snake. Each point in the tree has a real value...
Brendan McCane
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
15 years 5 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
COCOON
1999
Springer
15 years 4 months ago
An External Memory Data Structure for Shortest Path Queries
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
David A. Hutchinson, Anil Maheshwari, Norbert Zeh
CORR
1998
Springer
110views Education» more  CORR 1998»
14 years 11 months ago
Ultrametric Distance in Syntax
Phrase structure trees have a hierarchical structure. In many subjects, most notably in taxonomy such tree structures have been studied using ultrametrics. Here syntactical hierar...
Mark D. Roberts