115 search results - page 9 / 23 » Uniform Approximations for Transcendental Functions |
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
102
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
77
Voted
SIAMCO
2010
14 years 4 months ago
2010
In arbitrary dimension, we consider the semi-discrete elliptic operator -2 t + AM , where AM is a finite difference approximation of the operator - x((x) x). For this operator we d...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper a exible, high-throughput, low-complexity additive white gaussian noise (AWGN) channel generator is presented. The proposed generator employs a Mersenne-Twister to g...
85
Voted
RT
1995
Springer
15 years 1 months ago
1995
Springer
Abstract: The problem of global illumination is virtually synonymouswith solving the rendering equation. Although a great deal of research has been directed toward Monte Carlo and ...