3533 search results - page 81 / 707 » Locally Optimized RANSAC |
167
click to vote
SAC
2004
ACM
15 years 11 months ago
2004
ACM
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
164
click to vote
PVM
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
196
click to vote
VLDB
2007
ACM
16 years 12 days ago
2007
ACM
Multi-core processors are proliferated across different domains in recent years. In this paper, we study the performance of frequent pattern mining on a modern multi-core machine....
160
click to vote
AIPS
2010
15 years 8 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
140
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
We address ranging energy optimization for an unsynchronized localization system, which features robust sensor positioning, in the sense that specific accuracy requirements are f...