2880 search results - page 496 / 576 » Approximate Range Searching |
ICDE
2010
IEEE
14 years 4 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
EDBT
2009
ACM
14 years 4 months ago
2009
ACM
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
CIKM
2009
Springer
14 years 4 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
ATAL
2007
Springer
14 years 4 months ago
2007
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
WIDM
2006
ACM
14 years 3 months ago
2006
ACM
The huge amount of data available from Internet information sources has focused much attention on the sharing of distributed information through Peer Data Management Systems (PDMS...