Sciweavers

16666 search results - page 286 / 3334
» Descriptive and Computational Complexity
Sort
View
IACR
2011
127views more  IACR 2011»
14 years 6 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
CEC
2005
IEEE
16 years 8 days ago
Formation of modules in a computational model of embryogeny
An investigation is conducted into the effects of a complex mapping between genotype and phenotype upon a simulated evolutionary process. A model of embryogeny is utilised to grow ...
Chris P. Bowers
SIGCSE
2010
ACM
132views Education» more  SIGCSE 2010»
16 years 1 months ago
Undergraduate computer science education in China
This paper examines the current status of professional computing education for undergraduate majors and fundamental computer education for non-majors in China. We describe the evo...
Ming Zhang, Virginia Mary Lo
ICPPW
2003
IEEE
15 years 12 months ago
Grid Computing Pool and Its Framework
The aim of Grid Computing Pool (GCP) is to integrate heterogeneous large-scale computing devices and famous computing tools into a virtual supercomputer by using grid technology. ...
Yongwei Wu, Guangwen Yang, Jiayin Mao, Shuming Shi...
177
Voted
CONSTRAINTS
2010
116views more  CONSTRAINTS 2010»
15 years 4 months ago
Enabling local computation for partially ordered preferences
Abstract. Many computational problems linked to uncertainty and preference management can be expressed in terms of computing the marginal(s) of a combination of a collection of val...
Hélène Fargier, Emma Rollon, Nic Wil...