Sciweavers

3874 search results - page 435 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
CORR
2002
Springer
113views Education» more  CORR 2002»
15 years 6 months ago
Robust Global Localization Using Clustered Particle Filtering
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
Javier Nicolás Sánchez, Adam Milstei...
3DIM
2007
IEEE
15 years 10 months ago
Estimating the Location of a Camera with Respect to a 3D Model
An algorithm is presented to estimate the position of a hand-held camera with respect to a 3d world model constructed from range data and color imagery. Little prior knowledge is ...
Gehua Yang, Jacob Becker, Charles V. Stewart
APPROX
2008
Springer
83views Algorithms» more  APPROX 2008»
15 years 8 months ago
Sampling Hypersurfaces through Diffusion
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
Hariharan Narayanan, Partha Niyogi
ICPP
2005
IEEE
16 years 8 days ago
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
Wei Du, Gagan Agrawal
NIPS
2008
15 years 8 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr