395 search results - page 7 / 79 » Degrees of Weakly Computable Reals |
ESA
2005
Springer
14 years 2 months ago
2005
Springer
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
CIE
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We show that many so called discrete weak semilattices considered earlier in a series of author’s publications have hereditary undecidable first-order theories. Since ...
FOCS
2004
IEEE
14 years 15 days ago
2004
IEEE
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
APPML
2005
13 years 8 months ago
2005
Three iterative refinement schemes are studied for approximating the solutions of linear weakly singular Fredholm integral equations of the second kind. The rates of convergence a...