349 search results - page 48 / 70 » Covering a Set of Points with a Minimum Number of Lines |
ICIP
2002
IEEE
14 years 9 months ago
2002
IEEE
The approximation of surfaces to scattered data is an important problem encountered in a variety of scientific applications, such as reverse engineering, computer vision, computer...
GD
2004
Springer
14 years 1 months ago
2004
Springer
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erd¨os proved that t...
COMPGEOM
1994
ACM
14 years 17 hour ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
JCT
2008
13 years 8 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. We present a framework that automatically produces suggestions to resolve type errors in security-typed programs, enabling legacy code to be retrofit with comprehensive s...