2200 search results - page 41 / 440 » Bloch's Constant is Computable |
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we use random-selection protocols in the full-information model to solve classical problems in distributed computing. Our main results are the following: • An O(l...
ANTS
2004
Springer
15 years 3 months ago
2004
Springer
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
SIGUCCS
2000
ACM
15 years 2 months ago
2000
ACM
In this paper, we describe the process we went through to redesign our training program in order to make it more targeted to the individual user, more responsive to a constantly c...
BNCOD
1998
14 years 11 months ago
1998
Current database management system technology is unable to provide adequate support for Nomadic Computing. Mobile applications require systems which are sufficiently lightweight an...
NIXDORF
1992
15 years 1 months ago
1992
Abstract. We consider three paradigms of computation where the bene ts of a parallel solution are greater than usual. Paradigm 1 works on a time-varying input data set, whose size ...