104 search results - page 19 / 21 » Solving constrained multi-objective problems by objective sp... |
104
click to vote
ICRA
2000
IEEE
15 years 1 months ago
2000
IEEE
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
111
Voted
SIGMOD
2012
ACM
13 years 20 days ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
86
Voted
ICDAR
2007
IEEE
15 years 4 months ago
2007
IEEE
The Machine Learning and Pattern Recognition communities are facing two challenges: solving the normalization problem, and solving the deep learning problem. The normalization pro...
ECCV
2008
Springer
16 years 3 days ago
2008
Springer
Abstract. Affine registration has a long and venerable history in computer vision literature, and extensive work have been done for affine registrations in IR2 and IR3 . In this pa...
ICML
2006
IEEE
15 years 11 months ago
2006
IEEE
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...