Sciweavers

201 search results - page 14 / 41
» Computing nearest neighbors in real time
Sort
View
CLEF
2010
Springer
13 years 8 months ago
Random Sampling Image to Class Distance for Photo Annotation
Image classification or annotation is proved difficult for the computer algorithms. The Naive-Bayes Nearest Neighbor method is proposed to tackle the problem, and achieved the stat...
Deyuan Zhang, Bingquan Liu, Chengjie Sun, Xiaolong...
ICML
1994
IEEE
13 years 12 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak
IJFCS
2002
122views more  IJFCS 2002»
13 years 8 months ago
The Delaunay Hierarchy
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
Olivier Devillers
ICRA
2010
IEEE
343views Robotics» more  ICRA 2010»
13 years 7 months ago
Hands in action: real-time 3D reconstruction of hands in interaction with objects
— This paper presents a method for vision based estimation of the pose of human hands in interaction with objects. Despite the fact that most robotics applications of human hand ...
Javier Romero, Hedvig Kjellström, Danica Krag...
ICDE
2011
IEEE
271views Database» more  ICDE 2011»
13 years 4 days ago
Authentication of moving kNN queries
— A moving kNN query continuously reports the k nearest neighbors of a moving query point. In addition to the query result, a service provider that evaluates moving queries often...
Man Lung Yiu, Eric Lo, Duncan Yung