1593 search results - page 3 / 319 » The Complexity of Computing the Size of an Interval |
CASC
2009
Springer
14 years 25 days 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...
WSC
1997
13 years 7 months ago
1997
This article discusses implementation issues for the LBATCH and ABATCH batch means procedures of Fishman and Yarberry (1997). Theses procedures dynamically increase the batch size...
ICDE
2005
IEEE
14 years 7 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
PPSC
1997
13 years 7 months ago
1997
By taking data measurement errors into considerations, numerical results obtained by interval polynomial interpolation [5] are highly reliable. To reduce overestimation, combinati...
TCS
1998
13 years 5 months ago
1998
