We present a method for performing fault localization using similar program spectra. Our method assumes the existence of a faulty run and a larger number of correct runs. It then ...
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
In this demonstration we present MAPLE, a scalable peer-to-peer Nearest Neighbor (NN) query system for mobile environments. MAPLE is designed for the efficient sharing of query re...
Wei-Shinn Ku, Roger Zimmermann, Chi-Ngai Wan, Haoj...
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
K-Nearest Neighbors relies on the definition of a global metric. In contrast, Discriminant Adaptive Nearest Neighbor (DANN) computes a different metric at each query point based o...