Sciweavers

1261 search results - page 26 / 253
» Approximation algorithms for aligning points
Sort
View
72
Voted
NIPS
2003
14 years 11 months ago
Applying Metric-Trees to Belief-Point POMDPs
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
92
Voted
CGF
2006
183views more  CGF 2006»
14 years 9 months ago
Data-driven Local Coordinate Systems for Image-Based Rendering
Image-based representations of an object profit from known geometry. The more accurate this geometry is known, the better corresponding pixels in the different images can be align...
Gero Müller, Ralf Sarlette, Reinhard Klein
FOCM
2011
175views more  FOCM 2011»
14 years 4 months ago
Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
Donald Goldfarb, Shiqian Ma
AI
2006
Springer
15 years 1 months ago
Belief Selection in Point-Based Planning Algorithms for POMDPs
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
Masoumeh T. Izadi, Doina Precup, Danielle Azar
JMIV
2007
158views more  JMIV 2007»
14 years 9 months ago
On the Consistency of the Normalized Eight-Point Algorithm
A recently proposed argument to explain the improved performance of the eight-point algorithm that results from using normalized data [IEEE Trans. Pattern Anal. Mach. Intell., 25(9...
Wojciech Chojnacki, Michael J. Brooks