Sciweavers

96 search results - page 7 / 20
» Average-Case Analysis of a Nearest Neighbor Algorithm
Sort
View
STOC
2012
ACM
222views Algorithms» more  STOC 2012»
11 years 10 months ago
An analysis of one-dimensional schelling segregation
We analyze the Schelling model of segregation in which a society of n individuals live in a ring. Each individual is one of two races and is only satisfied with his location so l...
Christina Brandt, Nicole Immorlica, Gautam Kamath,...
ALT
2008
Springer
14 years 4 months ago
Exploiting Cluster-Structure to Predict the Labeling of a Graph
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
Mark Herbster
IVC
2006
175views more  IVC 2006»
13 years 7 months ago
Face recognition using optimal linear components of range images
This paper investigates the use of range images of faces for recognizing people. 3D scans of faces lead to range images that are linearly projected to low-dimensional subspaces fo...
Anuj Srivastava, Xiuwen Liu, Curt Hesher
ICDAR
2009
IEEE
14 years 2 months ago
An Improved Online Tamil Character Recognition Engine Using Post-Processing Methods
We propose script-specific post processing schemes for improving the recognition rate of online Tamil characters. At the first level, features derived at each sample point of the ...
Suresh Sundaram, Angarai Ganesan Ramakrishnan
IDA
2006
Springer
13 years 7 months ago
Classification of symbolic objects: A lazy learning approach
Symbolic data analysis aims at generalizing some standard statistical data mining methods, such as those developed for classification tasks, to the case of symbolic objects (SOs). ...
Annalisa Appice, Claudia d'Amato, Floriana Esposit...