1331 search results - page 1 / 267 » Complexity bounds for zero-test algorithms |
JSC
2006
13 years 4 months ago
2006
In this paper, we analyze the complexity of a zero test for expressions built from formal power series solutions of first order differential equations with non degenerate initial ...
TCS
1998
13 years 4 months ago
1998
JMLR
2010
12 years 11 months ago
2010
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
CCA
2000
Springer
13 years 9 months ago
2000
Springer
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...
SIAMCOMP
2000
13 years 4 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...