Sciweavers

649 search results - page 62 / 130
» Some Methods of Replacing the Nearest Neighbor Method
Sort
View
3DIM
2003
IEEE
13 years 11 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
ECCV
2008
Springer
14 years 9 months ago
Local Regularization for Multiclass Classification Facing Significant Intraclass Variations
We propose a new local learning scheme that is based on the principle of decisiveness: the learned classifier is expected to exhibit large variability in the direction of the test ...
Lior Wolf, Yoni Donner
ICMCS
2007
IEEE
214views Multimedia» more  ICMCS 2007»
14 years 2 months ago
Exploring Discriminative Learning for Text-Independent Speaker Recognition
Speaker verification is a technology of verifying the claimed identity of a speaker based on the speech signal from the speaker (voice print). To learn the score of similarity be...
Ming Liu, Zhengyou Zhang, Mark Hasegawa-Johnson, T...
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 9 months ago
Distance Based Indexing for String Proximity Search
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
Jai Macker, Murat Tasan, Süleyman Cenk Sahina...
IDEAL
2003
Springer
14 years 26 days ago
Agent Compromises in Distributed Problem Solving
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...
Yi Tang, Jiming Liu, Xiaolong Jin