Sciweavers

14548 search results - page 299 / 2910
» The Optimal Path-Matching Problem
Sort
View
ICPR
2008
IEEE
16 years 7 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
MOR
2008
98views more  MOR 2008»
15 years 6 months ago
An Analysis of Monotone Follower Problems for Diffusion Processes
We consider a singular stochastic control problem, which is called the Monotone Follower Stochastic Control Problem and give sufficient conditions for the existence and uniqueness...
Erhan Bayraktar, Masahiko Egami
SDM
2009
SIAM
219views Data Mining» more  SDM 2009»
16 years 3 months ago
A Hybrid Data Mining Metaheuristic for the p-Median Problem.
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
Alexandre Plastino, Erick R. Fonseca, Richard Fuch...
ICML
2007
IEEE
16 years 7 months ago
Transductive support vector machines for structured variables
We study the problem of learning kernel machines transductively for structured output variables. Transductive learning can be reduced to combinatorial optimization problems over a...
Alexander Zien, Ulf Brefeld, Tobias Scheffer
ORL
2008
87views more  ORL 2008»
15 years 5 months ago
On-line scheduling with non-crossing constraints
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
Lele Zhang, Kwanniti Khammuang, Andrew Wirth