Sciweavers

65 search results - page 1 / 13
» Is Nonparametric Learning Practical in Very High Dimensional...
Sort
View
IJCAI
1997
13 years 6 months ago
Is Nonparametric Learning Practical in Very High Dimensional Spaces?
Many of the challenges faced by the £eld of Computational Intelligence in building intelligent agents, involve determining mappings between numerous and varied sensor inputs and ...
Gregory Z. Grudic, Peter D. Lawrence
ICASSP
2010
IEEE
13 years 5 months ago
Robust regression using sparse learning for high dimensional parameter estimation problems
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
Kaushik Mitra, Ashok Veeraraghavan, Rama Chellappa
ICRA
2002
IEEE
147views Robotics» more  ICRA 2002»
13 years 9 months ago
Auxiliary Particle Filter Robot Localization from High-Dimensional Sensor Observations
We apply the auxiliary particle filter algorithm of Pitt and Shephard (1999) to the problem of robot localization. To deal with the high-dimensional sensor observations (images) ...
Nikos A. Vlassis, Bas Terwijn, Ben J. A. Krös...
ICML
2009
IEEE
13 years 11 months ago
Feature hashing for large scale multitask learning
Empirical evidence suggests that hashing is an effective strategy for dimensionality reduction and practical nonparametric estimation. In this paper we provide exponential tail bo...
Kilian Q. Weinberger, Anirban Dasgupta, John Langf...
CVPR
1997
IEEE
14 years 6 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe