We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmical...
Let S be a set of points in the plane in general position. A triangulation of S will be called even if all the points of S have an even degree. We show how to construct a triangul...
We view dynamic scheduling as a sequential decision problem. Firstly, we introduce a generalized planning operator, the stochastic task model (STM), which predicts the effects of ...
The adaptive TAP Gibbs free energy for a general densely connected probabilistic model with quadratic interactions and arbritary single site constraints is derived. We show how a ...
We show how a general grammar may be automatically adapted for fast parsing of utterances from a specific domain by means of constituent pruning and grammar specialization based o...