Sciweavers

Share
PVLDB
2010
149views more  PVLDB 2010»
9 years 2 months ago
GRAIL: Scalable Reachability Index for Large Graphs
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 ...
Hilmi Yildirim, Vineet Chaoji, Mohammed Javeed Zak...
CORR
2010
Springer
105views Education» more  CORR 2010»
9 years 4 months ago
Exact Shortest Path Queries for Planar Graphs Using Linear Space
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...
Shay Mozes, Christian Sommer
COMGEO
2008
ACM
9 years 4 months ago
Lower bounds for expected-case planar point location
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...
Theocharis Malamatos
TRECVID
2007
9 years 5 months ago
INESC, Porto at TRECVID 2007: Automatic and Interactive Video Search
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...
Catalin Calistru, Cristina Ribeiro, Gabriel David,...
SODA
2001
ACM
108views Algorithms» more  SODA 2001»
9 years 5 months ago
Entropy-preserving cuttings and space-efficient planar point location
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...
Sunil Arya, Theocharis Malamatos, David M. Mount
CCCG
2003
9 years 5 months ago
Computing the Closest Point to a Circle
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...
Pinaki Mitra, Asish Mukhopadhyay, S. V. Rao
CIKM
2008
Springer
9 years 5 months ago
TinyLex: static n-gram index pruning with perfect recall
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...
Derrick Coetzee
AAAI
2008
9 years 6 months ago
Adapting ADtrees for High Arity Features
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...
Robert Van Dam, Irene Langkilde-Geary, Dan Ventura
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
9 years 7 months ago
Efficient Expected-Case Algorithms for Planar Point Location
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...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
CIKM
2006
Springer
9 years 7 months ago
Approximate reverse k-nearest neighbor queries in general metric spaces
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...
Elke Achtert, Christian Böhm, Peer Kröge...
books