The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...
This paper presents an algorithm for unsupervised segmentation of color images. The main idea behind it is the use of the low-frequency content of images which allows for smoothin...
In this paper, we introduce localized homology, a theory for finding local geometric descriptions for topological attributes. Given a space and a cover of subspaces, we construct...