146 search results - page 1 / 30 » Medoid Queries in Large Spatial Databases |
SSD
2005
Springer
13 years 10 months ago
2005
Springer
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
VLDB
2008
ACM
14 years 4 months ago
2008
ACM
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
SSD
2007
Springer
13 years 10 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
IV
2002
IEEE
13 years 9 months ago
2002
IEEE
In this paper a visual approach to querying in large spatial databases is presented. A diagrammatic technique utilising a data flow metaphor is used to express different kinds of...
GIS
2002
ACM
13 years 4 months ago
2002
ACM
Enterprises in the public and private sectors have been making their large spatial data archives available over the Internet. However, interactive work with such large volumes of ...