Sciweavers

262 search results - page 4 / 53
» Conformal Mapping in Linear Time
Sort
View
AAAI
2006
13 years 8 months ago
Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes)
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
Héctor Palacios, Hector Geffner
CRV
2011
IEEE
352views Robotics» more  CRV 2011»
12 years 7 months ago
Conformative Filter: A Probabilistic Framework for Localization in Reduced Space
— Algorithmic problem reduction is a fundamental approach to problem solving in many fields, including robotics. To solve a problem using this scheme, we must reduce the problem...
Chatavut Viriyasuthee, Gregory Dudek
ICRA
2003
IEEE
116views Robotics» more  ICRA 2003»
14 years 20 days ago
Linear time vehicle relocation in SLAM
Abstract— In this paper we propose an algorithm to determine the location of a vehicle in an environment represented by a stochastic map, given a set of environment measurements ...
José Neira, Juan D. Tardós, Jos&eacu...
ESANN
2003
13 years 8 months ago
Locally Linear Embedding versus Isotop
Abstract. Recently, a new method intended to realize conformal mappings has been published. Called Locally Linear Embedding (LLE), this method can map high-dimensional data lying o...
John Aldo Lee, Cédric Archambeau, Michel Ve...
MICCAI
2005
Springer
14 years 8 months ago
Automated Surface Matching Using Mutual Information Applied to Riemann Surface Structures
Many medical imaging applications require the computation of dense correspondence vector fields that match one surface with another. To avoid the need for a large set of manually-d...
Yalin Wang, Ming-Chang Chiang, Paul M. Thompson