451 search results - page 43 / 91 » Some Lower Bounds on Geometric Separability Problems |
101
click to vote
SODA
2003
ACM
14 years 11 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
ICONIP
2007
14 years 11 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
116
click to vote
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
In some application domains, such as medical imaging, the objects that compose the scene are known as well as some of their properties and their spatial arrangement. We can take ad...
ICRA
1993
IEEE
15 years 1 months ago
1993
IEEE
This paper addresses the problem of numerically finding an optimal path for a robot with non-holonomic constraints. A car like robot, whose turning radius is lower bounded is cons...