1888 search results - page 128 / 378 » Algorithms for Querying by Spatial Structure |
139
click to vote
TKDE
2002
15 years 4 months ago
2002
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
226
click to vote
GIS
2009
ACM
16 years 5 months ago
2009
ACM
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions inc...
149
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
162
click to vote
ESA
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
142
click to vote
SIGMOD
2011
ACM
14 years 7 months ago
2011
ACM
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...