Sciweavers

1388 search results - page 211 / 278
» Querying Linguistic Trees
Sort
View
DAGSTUHL
2004
15 years 1 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
98
Voted
AAAI
1994
15 years 1 months ago
Using Induction to Refine Information Retrieval Strategies
Conceptual information retrieval systems use structured document indices, domain knowledge and a set of heuristic retrieval strategies to match user queries with a set of indices ...
Catherine Baudin, Barney Pell, Smadar Kedar
JAPLL
2010
124views more  JAPLL 2010»
14 years 11 months ago
Reasoning about XML with temporal logics and automata
We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of pr...
Leonid Libkin, Cristina Sirangelo
PODS
2009
ACM
122views Database» more  PODS 2009»
16 years 1 months ago
Satisfiability of downward XPath with data equality tests
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
Diego Figueira
CVPR
2010
IEEE
15 years 9 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff