534 search results - page 16 / 107 » Efficient polynomial L-approximations |
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
ECCV
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
BMCBI
2007
13 years 7 months ago
2007
Background: In the context of genomic association studies, for which a large number of statistical tests are performed simultaneously, the local False Discovery Rate (lFDR), which...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...
COMGEO
2006
ACM
13 years 7 months ago
2006
ACM
We present an approach for the exact and efficient computation of a cell in an arrangement of quadric surfaces. All calculations are based on exact rational algebraic methods and ...