3533 search results - page 14 / 707 » Locally Optimized RANSAC |
NIPS
2007
14 years 11 months ago
2007
Sound localization by barn owls is commonly modeled as a matching procedure where localization cues derived from auditory inputs are compared to stored templates. While the matchi...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
IDA
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...
104
click to vote
ICDE
2012
IEEE
12 years 12 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Ant colony optimization (ACO) is a well known metaheuristic. In the literature it has been used for tackling many optimization problems. Often, ACO is hybridized with a local sear...