Sciweavers

Share
40 search results - page 1 / 8
» Fault Localization With Nearest Neighbor Queries
Sort
View
KBSE
2003
IEEE
10 years 6 months ago
Fault Localization With Nearest Neighbor Queries
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 ...
Manos Renieris, Steven P. Reiss
ICAPR
2009
Springer
10 years 7 months ago
Hierarchical Local Maps for Robust Approximate Nearest Neighbor Computation
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...
Pratyush Bhatt, Anoop M. Namboodiri
ICDE
2006
IEEE
192views Database» more  ICDE 2006»
11 years 2 months ago
MAPLE: A Mobile Scalable P2P Nearest Neighbor Query System for Location-based Services
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...
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
8 years 3 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
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 ...
Jia Pan, Dinesh Manocha
ICPR
2006
IEEE
11 years 2 months ago
Automatic Adjustment of Discriminant Adaptive Nearest Neighbor
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...
Cédric Archambeau, Michel Verleysen, Nicola...
books