10988 search results - page 229 / 2198 » Algorithmic Folding Complexity |
124
Voted
WDAG
1990
Springer
15 years 7 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
261
click to vote
STOC
2012
ACM
13 years 6 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
108
Voted
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dn where n + 1 is the number of unknowns and D ...
107
click to vote
MFCS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Problem parameters are ubiquitous. In every area of computer science, we find all kinds of “special aspects” to the problems encountered. Hence, the study of paramet...
145
click to vote
CIMAGING
2010
15 years 4 months ago
2010
We present the implementation and evaluation of a penalized alternating minimization (AM) method1 for the computation of a specimen's complex transmittance function (magnitud...