Sciweavers

1388 search results - page 62 / 278
» Querying Linguistic Trees
Sort
View
VLDB
2005
ACM
226views Database» more  VLDB 2005»
15 years 6 months ago
BATON: A Balanced Tree Structure for Peer-to-Peer Networks
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure caus...
H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
15 years 2 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
ACL
1997
15 years 1 months ago
Sentence Planning as Description Using Tree Adjoining Grammar
We present an algorithm for simultaneously constructing both the syntax and semantics of a sentence using a Lexicalized Tree Adjoining Grammar (LTAG). This approach captures natur...
Matthew Stone, Christine Doran
192
Voted
GIS
2007
ACM
16 years 1 months ago
TS2-tree - an efficient similarity based organization for trajectory data
The increasingly popular GPS technology and the growing amount of trajectory data it generates create the need for developing applications that efficiently store and query traject...
Petko Bakalov, Eamonn J. Keogh, Vassilis J. Tsotra...
141
Voted
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 3 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu