1399 search results - page 63 / 280 » Multi-party Finite Computations |
DATE
2009
IEEE
14 years 4 months ago
2009
IEEE
This paper explores the use of SAT-Modulo Theory in determination of bit-widths for finite precision implementation of numerical calculations, specifically in the context of sci...
FOCS
2007
IEEE
14 years 4 months ago
2007
IEEE
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Gro...
AAAI
2008
14 years 8 days ago
2008
"Human computation" is a recent approach that extracts information from large numbers of Web users. reCAPTCHA is a human computation project that improves the process of...
SFP
2003
13 years 11 months ago
2003
Abstract Hume is a domain-specific programming language targeting resourcebounded computations. It is based on generalised concurrent bounded automata, controlled by transitions c...