Sciweavers

1369 search results - page 79 / 274
» Lattice computations for random numbers
Sort
View
PODC
2003
ACM
14 years 2 months ago
An asynchronous protocol for distributed computation of RSA inverses and its applications
This paper presents an efficient asynchronous protocol to compute RSA inverses with respect to a public RSA modulus N whose factorization is secret and shared among a group of pa...
Christian Cachin
CAV
2009
Springer
132views Hardware» more  CAV 2009»
14 years 9 months ago
Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-b...
Thao Dang, David Salinas
PPSN
2004
Springer
14 years 2 months ago
Phase Transition Properties of Clustered Travelling Salesman Problem Instances Generated with Evolutionary Computation
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
Jano I. van Hemert, Neil Urquhart
CP
2010
Springer
13 years 7 months ago
Computing the Density of States of Boolean Formulas
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...
Stefano Ermon, Carla P. Gomes, Bart Selman
CANDC
2002
ACM
13 years 8 months ago
Computer aided creativity: practical experience and theoretical concerns
In this paper I will outline some of the practical experiences and theoretical concerns that have informed some 15 years of research into the relationship between human creativity...
Robert Pepperell