1888 search results - page 207 / 378 » Algorithms for Querying by Spatial Structure |
223
Voted
GIS
2009
ACM
16 years 1 months ago
2009
ACM
In this paper, we formalize the novel concept of Constrained Reverse k-Nearest Neighbor (CRkNN) search on mobile objects (clients) performed at a central server. The CRkNN query c...
189
click to vote
COMPGEOM
2005
ACM
15 years 9 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
178
Voted
IMR
2003
Springer
16 years 4 days ago
2003
Springer
We describe data structures for representing simplicial meshes compactly while supporting online queries and updates efficiently. Our data structure requires about a factor of fi...
288
Voted
POPL
2008
ACM
16 years 7 months ago
2008
ACM
This paper presents a demand-driven, flow-insensitive analysis algorithm for answering may-alias queries. We formulate the computation of alias queries as a CFL-reachability probl...
214
Voted
CIKM
2008
Springer
15 years 9 months ago
2008
Springer
The Web contains a large amount of documents and increasingly, also semantic data in the form of RDF triples. Many of these triples are annotations that are associated with docume...