In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
An important research issue in multimedia databases is the retrieval of similar objects. For most applications in multimedia databases, an exact search is not meaningful. Thus, mu...
This paper proposes a new problem, called superseding nearest neighbor search, on uncertain spatial databases, where each object is described by a multidimensional probability den...
Sze Man Yuen, Yufei Tao, Xiaokui Xiao, Jian Pei, D...
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...