Sciweavers

13621 search results - page 9 / 2725
» Computability and Complexity in Self-assembly
Sort
View
GC
2011
Springer
13 years 1 months ago
Algorithmic Folding Complexity
Jean Cardinal, Erik D. Demaine, Martin L. Demaine,...
IACR
2011
127views more  IACR 2011»
12 years 9 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
ECCTD
2011
108views more  ECCTD 2011»
12 years 9 months ago
Low complexity least-squares filter design for the correction of linear time-varying systems
Abstract—In this paper, a low complexity algorithm for the design of a time-varying correction filter of finite impulse response (FIR) type is presented. Using the obtained fi...
Michael Soudan, Christian Vogel
JMLR
2012
12 years 8 days ago
Sample Complexity of Composite Likelihood
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...
Joseph K. Bradley, Carlos Guestrin