Sciweavers

413 search results - page 7 / 83
» On Solving Geometric Optimization Problems Using Shortest Pa...
Sort
View
ICPR
2008
IEEE
14 years 8 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
STACS
2010
Springer
14 years 2 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...
TEC
2002
117views more  TEC 2002»
13 years 7 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna
JCT
1998
99views more  JCT 1998»
13 years 7 months ago
From Hall's Matching Theorem to Optimal Routing on Hypercubes
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
Shuhong Gao, Beth Novick, Ke Qiu
ICCV
2005
IEEE
14 years 1 months ago
Space-Time Scene Manifolds
The space of images is known to be a non-linear subspace that is difficult to model. This paper derives an algorithm that walks within this space. We seek a manifold through the ...
Yonatan Wexler, Denis Simakov