PVLDB
2010
13 years 9 months ago
2010
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
COMGEO
2008
ACM
13 years 11 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
TRECVID
2007
14 years 9 days ago
2007
The INESC Porto group has participated in the search task (automatic and interactive). Our approach combines high-level features (the 39 concepts of the LSCOM-Lite set) with low-l...
SODA
2001
ACM
14 years 16 days ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
CCCG
2003
14 years 16 days ago
2003
In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One al...
CIKM
2008
Springer
14 years 29 days ago
2008
Springer
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
AAAI
2008
14 years 1 months ago
2008
ADtrees, a data structure useful for caching sufficient statistics, have been successfully adapted to grow lazily when memory is limited and to update sequentially with an increme...
SWAT
2000
Springer
14 years 2 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
CIKM
2006
Springer
14 years 2 months ago
2006
Springer
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...