Sciweavers

1041 search results - page 51 / 209
» Randomizing Reductions of Search Problems
Sort
View
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
14 years 1 months ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle
ICCS
2004
Springer
14 years 1 months ago
The Computational Complexity of Orientation Search in Cryo-Electron Microscopy
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...
Taneli Mielikäinen, Janne Ravantti, Esko Ukko...
VMV
2001
209views Visualization» more  VMV 2001»
13 years 9 months ago
A Novel Probabilistic Model for 3D Object Recognition: Spin-Glass Markov Random Fields
This contribution presents a new class of MRF, that is inspired by methods of statistical physics. The new energy function assumes full-connectivity in the neighborhood system and...
Barbara Caputo, Sahla Bouattour, Dietrich Paulus
ICRA
2002
IEEE
183views Robotics» more  ICRA 2002»
14 years 1 months ago
Mobile Robot Localization Based on Random Closed Set Model Maps
In this paper we present a novel approach to mobile robot navigation in natural unstructured environments. Natural scenes can be considered as random fields where a large number ...
Stefan Rolfes, Maria-João Rendas
COCOON
2009
Springer
14 years 2 months ago
Sublinear-Time Algorithms for Tournament Graphs
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
Stefan S. Dantchev, Tom Friedetzky, Lars Nagel