150 search results - page 21 / 30 » Traversing a set of points with a minimum number of turns |
ICALP
2001
Springer
14 years 23 hour ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
GD
2007
Springer
14 years 1 months ago
2007
Springer
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
KDD
2001
ACM
14 years 8 months ago
2001
ACM
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
ESA
2003
Springer
14 years 23 days ago
2003
Springer
In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...
MP
2011
13 years 2 months ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...