12 search results - page 2 / 3 » On the complexity of real root isolation using continued fra... |
CASC
2009
Springer
13 years 11 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
DAGSTUHL
2008
13 years 6 months ago
2008
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...
ICCV
2007
IEEE
14 years 6 months ago
2007
IEEE
Many computer vision and image processing tasks require the preservation of local discontinuities, terminations and bifurcations. Denoising with feature preservation is a challeng...
ICAS
2009
IEEE
13 years 8 months ago
2009
IEEE
As long as computers continue to get more CPU processing power, data centers need to optimize their power usage. We can do this and maintain the same complexity level as before by...
IOR
2002
13 years 4 months ago
2002
Then these analytically motivated abstractions were gradually made more intricate as the body of mathematical techniques grew. The trend went from elementary analysis of complex, i...