565 search results - page 62 / 113 » A Guided Monte Carlo Approach to Optimization Problems |
STOC
2005
ACM
15 years 10 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
As an example of the recently introduced concept of rate of innovation, signals that are linear combinations of a finite number of Diracs per unit time can be acquired by linear fi...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In traditional framework of Compressive Sensing (CS), only sparse prior on the property of signals in time or frequency domain is adopted to guarantee the exact inverse recovery. ...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we present a new approach based on Markov Chain Monte Carlo(MCMC) for the stable monocular tracking of variable interacting targets in 3D space. The crucial problem...
ICARCV
2006
IEEE
15 years 4 months ago
2006
IEEE
— In the simultaneous localization and mapping (SLAM) problem, a mobile robot must build a map of its environment while simultaneously determining its location within that map. W...