2168 search results - page 236 / 434 » Randomized Algorithms and Complexity Theory |
115
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose a new method for recovering a 3-D object shape from an image sequence. In order to recover high-resolution relative depth without using the complex Markov random field...
116
click to vote
IROS
2008
IEEE
15 years 10 months ago
2008
IEEE
— This paper provides a detailed analysis of the motion planning subsystem for the MIT DARPA Urban Challenge vehicle. The approach is based on the Rapidly-exploring Random Trees ...
163
click to vote
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— A non-parametric, low-complexity algorithm for accurate and simultaneous localization of multiple sensors from scarce and imperfect ranging information is proposed. The techniq...
154
click to vote
COCO
2008
Springer
15 years 5 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
160
click to vote
IACR
2011
14 years 3 months ago
2011
Search for cryptographic keys in RAM is a new and prospective technology which can be used, primarily, in the computer forensics. In order to use it, a cryptanalyst must solve, at...