Sciweavers

241 search results - page 47 / 49
» Nearest Neighbor Discriminant Analysis
Sort
View
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
11 years 10 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
CVPR
2009
IEEE
15 years 2 months ago
Dense saliency-based spatiotemporal feature points for action recognition
Several spatiotemporal feature point detectors have been recently used in video analysis for action recognition. Feature points are detected using a number of measures, namely sali...
Konstantinos Rapantzikos, Stefanos D. Kollias, Yan...
KDD
2007
ACM
202views Data Mining» more  KDD 2007»
14 years 8 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...
MOBIHOC
2005
ACM
14 years 7 months ago
Inducing spatial clustering in MAC contention for spread spectrum ad hoc networks
This paper proposes a new principle for designing MAC protocols for spread spectrum based ad hoc networks ? inducing spatial clustering in contending transmitters/receivers. We fi...
Xiangying Yang, Gustavo de Veciana
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 4 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat