1672 search results - page 134 / 335 » Tightness problems in the plane |
154
Voted
COSIT
1995
Springer
15 years 9 months ago
1995
Springer
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
144
click to vote
CCCG
2006
15 years 7 months ago
2006
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
171
click to vote
SIROCCO
2004
15 years 7 months ago
2004
We consider a problem motivated by the design of ATM (Asynchronous Transfer Mode) networks. Given a physical network and an All-to-All traffic, the problem consists in designing a...
157
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we propose a method for support vector machine classification using indefinite kernels. Instead of directly minimizing or stabilizing a nonconvex loss function, our...
139
click to vote
IEICET
2006
15 years 5 months ago
2006
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...