Sciweavers

3608 search results - page 138 / 722
» compute 2011
Sort
View
GC
2011
Springer
14 years 10 months ago
Algorithmic Folding Complexity
Jean Cardinal, Erik D. Demaine, Martin L. Demaine,...
TIT
2011
149views more  TIT 2011»
15 years 1 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...
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
COMCOM
2011
15 years 1 months ago
OSGi-based services architecture for Cyber-Physical Home Control Systems
Chin-Feng Lai, Yi-Wei Ma, Sung-Yen Chang, Han-Chie...
CVGIP
2011
15 years 1 months ago
Sketch guided solid texturing
Guo-Xin Zhang, Song-Pei Du, Yu-Kun Lai, Tianyun Ni...