1388 search results - page 132 / 278 » Querying Linguistic Trees |
104
Voted
EMNLP
2009
14 years 10 months ago
2009
We present a scalable joint language model designed to utilize fine-grain syntactic tags. We discuss challenges such a design faces and describe our solutions that scale well to l...
77
Voted
ICDE
2010
IEEE
16 years 15 days ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
244
click to vote
ICDE
1996
IEEE
16 years 2 months ago
1996
IEEE
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
101
click to vote
VLDB
2004
ACM
15 years 6 months ago
2004
ACM
This paper addresses the question of updating relational databases through XML views. Using query trees to capture the notions of selection, projection, nesting, grouping, and het...
98
Voted
CCCG
2006
15 years 2 months ago
2006
A k-nearest neighbor search algorithm for the Pyramid technique is presented. The Pyramid technique divides d-dimensional data space into 2d pyramids. Given a query point q, we in...