Sciweavers

2200 search results - page 56 / 440
» Bloch's Constant is Computable
Sort
View
STOC
2007
ACM
102views Algorithms» more  STOC 2007»
15 years 10 months ago
Zero-knowledge from secure multiparty computation
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
FOCS
2006
IEEE
15 years 4 months ago
Towards Secure and Scalable Computation in Peer-to-Peer Networks
We consider the problems of Byzantine Agreement and Leader Election, where a constant fraction b < 1/3 of processors are controlled by a malicious adversary. The first problem...
Valerie King, Jared Saia, Vishal Sanwalani, Erik V...
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 2 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
15 years 4 months ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström
ICCV
2003
IEEE
15 years 3 months ago
Dynamic Texture Segmentation
We address the problem of segmenting a sequence of images of natural scenes into disjoint regions that are characterized by constant spatio-temporal statistics. We model the spati...
Gianfranco Doretto, Daniel Cremers, Paolo Favaro, ...