71 search results - page 1 / 15 » On the Complexity of Reliable Root Approximation |
122
Voted
CASC
2009
Springer
15 years 10 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...
126
Voted
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
123
click to vote
IOR
2010
15 years 16 days ago
2010
Reliable risk measurement is a key problem for financial institutions and regulatory authorities. The current industry standard Value-at-Risk has several deficiencies. Improved ri...
110
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We present an efficient pixel-sampling technique for histogram-based search. Given a template image as a query, a typical histogram-based algorithm aims to find the location of ...
120
click to vote
ICIP
1998
IEEE
16 years 4 months ago
1998
IEEE
A method has beenproposed for blindly estimating the Point Spread Function (PSF) of video data. The PSF's of the images in a sequence are assumed to be of compact support and...