481 search results - page 57 / 97 » Approximate XML Query Answers |
STOC
2001
ACM
14 years 8 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
DIS
1998
Springer
14 years 7 hour ago
1998
Springer
We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustivene...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Structural indices play a significant role in improving the efficiency of XML query evaluation. Being able to compare various structural indexing techniques is critical for a DBM...
EDBT
2009
ACM
13 years 11 months ago
2009
ACM
Range queries for querying the current and future positions of the moving objects have received growing interests in the research community. Existing methods, however, assume that...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...