827 search results - page 69 / 166 » The Complexity of Probabilistic Lobbying |
193
click to vote
IACR
2011
14 years 6 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
176
click to vote
INTERSPEECH
2010
15 years 1 months ago
2010
Statistical methods for voice conversion are usually based on a single model selected in order to represent a tradeoff between goodness of fit and complexity. In this paper we ass...
204
click to vote
JMLR
2010
15 years 1 months ago
2010
Inducing a grammar from text has proven to be a notoriously challenging learning task despite decades of research. The primary reason for its difficulty is that in order to induce...
237
click to vote
APVIS
2011
14 years 6 months ago
2011
NETSPEAK helps writers in choosing words while writing a text. It checks for the commonness of phrases and allows for the retrieval of alternatives by means of wildcard queries. T...
241
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
Recent work on background subtraction has shown developments on two major fronts. In one, there has been increasing sophistication of probabilistic models, from mixtures of Gaussi...