50 search results - page 4 / 10 » Efficient Updates for Continuous Skyline Computations |
TKDE
2008
13 years 5 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
SSD
2007
Springer
13 years 12 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 ...
ICFP
2008
ACM
14 years 5 months ago
2008
ACM
Self-adjusting programs respond automatically and efficiently to input changes by tracking the dynamic data dependences of the computation and incrementally updating the output as...
IS
2008
13 years 5 months ago
2008
Performing data mining tasks in streaming data is considered a challenging research direction, due to the continuous data evolution. In this work, we focus on the problem of clust...
ALGORITHMICA
2002
13 years 5 months ago
2002
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...