Results 1  10
of
31,088
Tight Parallel Repetition Theorems for Publiccoin Arguments
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 109
, 2009
"... Following Hastad et al. [HPPW08], we study parallel repetition theorems for publiccoin interactive arguments and their generalizations. We obtain the following results: 1. We show that the reduction of Hastad et al. [HPPW08] actually gives a tight direct product theorem for publiccoin interactive ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Following Hastad et al. [HPPW08], we study parallel repetition theorems for publiccoin interactive arguments and their generalizations. We obtain the following results: 1. We show that the reduction of Hastad et al. [HPPW08] actually gives a tight direct product theorem for publiccoin interactive
Tight Parallel Repetition Theorems for Publiccoin Arguments
, 2009
"... Following Hastad et al. [HPPW08], we study parallel repetition theorems for publiccoin interactive arguments and their generalizations. We obtain the following results: 1. We show that the reduction of Hastad et al. [HPPW08] actually gives a tight direct product theorem for publiccoin interactive ..."
Abstract
 Add to MetaCart
Following Hastad et al. [HPPW08], we study parallel repetition theorems for publiccoin interactive arguments and their generalizations. We obtain the following results: 1. We show that the reduction of Hastad et al. [HPPW08] actually gives a tight direct product theorem for publiccoin interactive
Stochastic Inversion Transduction Grammars and Bilingual Parsing of Parallel Corpora
, 1997
"... ..."
PublicCoin Parallel ZeroKnowledge for NP
, 2011
"... We show that, assuming the existence of collisionresistant hash functions, every language in NP has a constantround publiccoin zeroknowledge argument that remains secure under unbounded parallel composition (a.k.a. parallel zero knowledge.) Our protocol is a variant of Barak’s zeroknowledge arg ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We show that, assuming the existence of collisionresistant hash functions, every language in NP has a constantround publiccoin zeroknowledge argument that remains secure under unbounded parallel composition (a.k.a. parallel zero knowledge.) Our protocol is a variant of Barak’s zero
FAST VOLUME RENDERING USING A SHEARWARP FACTORIZATION OF THE VIEWING TRANSFORMATION
, 1995
"... Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques that req ..."
Abstract

Cited by 541 (2 self)
 Add to MetaCart
Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques
A Perspective on Psychology and Economics
, 2001
"... This essay provides a perspective on the trend towards integrating psychology into economics. Some topics are discussed, and arguments are provided for why movement towards greater psychological realism in economics will improve mainstream economics. ..."
Abstract

Cited by 756 (10 self)
 Add to MetaCart
This essay provides a perspective on the trend towards integrating psychology into economics. Some topics are discussed, and arguments are provided for why movement towards greater psychological realism in economics will improve mainstream economics.
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
Knowledge and Common Knowledge in a Distributed Environment
 Journal of the ACM
, 1984
"... : Reasoning about knowledge seems to play a fundamental role in distributed systems. Indeed, such reasoning is a central part of the informal intuitive arguments used in the design of distributed protocols. Communication in a distributed system can be viewed as the act of transforming the system&apo ..."
Abstract

Cited by 577 (55 self)
 Add to MetaCart
: Reasoning about knowledge seems to play a fundamental role in distributed systems. Indeed, such reasoning is a central part of the informal intuitive arguments used in the design of distributed protocols. Communication in a distributed system can be viewed as the act of transforming the system
Boosting a Weak Learning Algorithm By Majority
, 1995
"... We present an algorithm for improving the accuracy of algorithms for learning binary concepts. The improvement is achieved by combining a large number of hypotheses, each of which is generated by training the given learning algorithm on a different set of examples. Our algorithm is based on ideas pr ..."
Abstract

Cited by 516 (15 self)
 Add to MetaCart
for parallelizing PAC learning algorithms. We provide extensions of our algorithms to cases in which the conc...
Convex Analysis
, 1970
"... In this book we aim to present, in a unified framework, a broad spectrum of mathematical theory that has grown in connection with the study of problems of optimization, equilibrium, control, and stability of linear and nonlinear systems. The title Variational Analysis reflects this breadth. For a lo ..."
Abstract

Cited by 5350 (67 self)
 Add to MetaCart
progressed also to the study of socalled stationary points, critical points, and other indications of singularity that a point might have relative to its neighbors, especially in association with existence theorems for differential equations.
Results 1  10
of
31,088