Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
Voronoi condensing reduces training patterns of nearest neighbor classifiers without changing the classification boundaries. This method plays important roles not only in the near...
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Abstract. We present a new parallel computation model called the Parallel ResourceOptimal computation model. PRO is a framework being proposed to enable the design of efficient and...