The main contribution of this paper is a bulk-loading algorithm for multi-way dynamic metric access methods based on the covering radius of a representative, like the Slim-tree. Th...
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
Yakov Keselman, Ali Shokoufandeh, M. Fatih Demirci...
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...
Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish...