Sciweavers

1388 search results - page 63 / 278
» Querying Linguistic Trees
Sort
View
CORR
2012
Springer
222views Education» more  CORR 2012»
13 years 8 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
15 years 6 months ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank
FQAS
2006
Springer
94views Database» more  FQAS 2006»
15 years 4 months ago
Term Disambiguation in Natural Language Query for XML
Converting a natural language query sentence into a formal database query is a major challenge. We have constructed NaLIX, a natural language interface for querying XML data. Throu...
Yunyao Li, Huahai Yang, H. V. Jagadish
95
Voted
ACJ
2006
85views more  ACJ 2006»
15 years 18 days ago
Tree Automata for Schema-Level Filtering of XML Associations
In this paper we present query filtering techniques based on bottom-up tree automata for XML access control. In our authorization model (RXACL), RDF statements are used to represen...
Vaibhav Gowadia, Csilla Farkas
AINA
2008
IEEE
15 years 2 months ago
An Efficient Tree-Based Tag Identification Protocol for RFID Systems
This paper presents an efficient tree-based query protocol for tag identification in Radio Frequency Identification (RFID) systems. Instead of reducing collisions, our proposed pro...
Kuo-Hui Yeh, N. W. Lo, Enrico Winata