Sciweavers

7 search results - page 1 / 2
» Hardness of Nearest Neighbor under L-infinity
Sort
View
FOCS
2008
IEEE
13 years 5 months ago
Hardness of Nearest Neighbor under L-infinity
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
Alexandr Andoni, Dorian Croitoru, Mihai Patrascu
ICDM
2007
IEEE
156views Data Mining» more  ICDM 2007»
13 years 9 months ago
Computing Correlation Anomaly Scores Using Stochastic Nearest Neighbors
This paper addresses the task of change analysis of correlated multi-sensor systems. The goal of change analysis is to compute the anomaly score of each sensor when we know that t...
Tsuyoshi Idé, Spiros Papadimitriou, Michail...
COMPGEOM
2010
ACM
13 years 10 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
TNN
2008
124views more  TNN 2008»
13 years 5 months ago
Just-in-Time Adaptive Classifiers - Part II: Designing the Classifier
Aging effects, environmental changes, thermal drifts, and soft and hard faults affect physical systems by changing their nature and behavior over time. To cope with a process evolu...
Cesare Alippi, Manuel Roveri
KDD
2007
ACM
202views Data Mining» more  KDD 2007»
14 years 5 months ago
Support feature machine for classification of abnormal brain activity
In this study, a novel multidimensional time series classification technique, namely support feature machine (SFM), is proposed. SFM is inspired by the optimization model of suppo...
Wanpracha Art Chaovalitwongse, Ya-Ju Fan, Rajesh C...