Sciweavers

11565 search results - page 189 / 2313
» Computing Minimal Mappings
Sort
View
146
Voted
JALC
2006
133views more  JALC 2006»
15 years 4 months ago
Power and Efficiency of Minimal Parallelism in Polarizationless P Systems
Minimal parallelism was recently introduced [3] as a way of using the rules of a P system: from each set of applicable rules associated to a membrane, at least one rule must be ap...
Tseren-Onolt Ishdorj
233
Voted
ICCV
2011
IEEE
14 years 3 months ago
Correspondence Free Registration through a Point-to-Model Distance Minimization
This paper presents a novel formulation, which derives in a smooth minimization problem, to tackle the rigid registration between a given point set and a model set. Unlike most of ...
Mohammad Rouhani and Angel D. Sappa
151
Voted
ICCV
2011
IEEE
14 years 4 months ago
Geometrically Consistent Elastic Matching of 3D Shapes: A Linear Programming Solution
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
Thomas Windheuser, Ulrich Schlickewei, Frank R. Sc...
ICCV
2003
IEEE
15 years 9 months ago
Meshfree Particle Method
Many of the computer vision algorithms have been posed in various forms of differential equations, derived from minimization of specific energy functionals, and the finite eleme...
Huafeng Liu, Pengcheng Shi
ICRA
2002
IEEE
117views Robotics» more  ICRA 2002»
15 years 9 months ago
Multi-Robot Exploration Controlled by a Market Economy
This work presents a novel approach to efficient multirobot mapping and exploration which exploits a market architecture in order to maximize information gain while minimizing inc...
Robert Zlot, Anthony Stentz, M. Bernardine Dias, S...