71 search results - page 2 / 15 » Derivation Tree Analysis for Accelerated Fixed-Point Computa... |
DCC
2001
IEEE
14 years 5 months ago
2001
IEEE
Recently, and contrary to the common belief, Rivest and Silverman argued that the use of strong primes is unnecessary in the RSA cryptosystem. This paper analyzes how valid this as...
ICFP
2003
ACM
14 years 5 months ago
2003
ACM
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
CCA
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
TSP
2008
13 years 5 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
FOCS
1992
IEEE
13 years 9 months ago
1992
IEEE
The main purpose of this paper is to promote the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. W...