1388 search results - page 89 / 278 » Querying Linguistic Trees |
92
Voted
ACL
2000
15 years 2 months ago
2000
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...
131
Voted
COCOON
1999
Springer
15 years 4 months ago
1999
Springer
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...
180
Voted
SIGMOD
2005
ACM
16 years 23 days ago
2005
ACM
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
109
Voted
AAAI
2008
15 years 2 months ago
2008
ADtrees, a data structure useful for caching sufficient statistics, have been successfully adapted to grow lazily when memory is limited and to update sequentially with an increme...
101
Voted
LICS
2005
IEEE
15 years 6 months ago
2005
IEEE
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...