183 search results - page 33 / 37 » Winner-Update Algorithm for Nearest Neighbor Search |
EDBT
2004
ACM
15 years 9 months ago
2004
ACM
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...
CEC
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—In the real world, many applications are nonstationary optimization problems. This requires that optimization algorithms need to not only find the global optimal soluti...
108
Voted
W2GIS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
112
Voted
KDD
2008
ACM
15 years 10 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
130
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...