2608 search results - page 188 / 522 » Inferring Answers to Queries |
160
Voted
STACS
2005
Springer
16 years 17 days ago
2005
Springer
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
198
Voted
COMPGEOM
2007
ACM
15 years 11 months ago
2007
ACM
We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let 1 be a real number. Distances in each face of this sub...
172
Voted
EDBT
2002
ACM
16 years 7 months ago
2002
ACM
Abstract. Aggregate window queries return summarized information about objects that fall inside a query rectangle (e.g., the number of objects instead of their concrete ids). Tradi...
227
click to vote
COMGEO
2008
ACM
15 years 7 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...
192
click to vote
NAR
2007
15 years 6 months ago
2007
COMPASS is a method for homology detection and local alignment construction based on the comparison of multiple sequence alignments (MSAs). The method derives numerical profiles f...