Sciweavers

1855 search results - page 5 / 371
» A coding theorem for distributed computation
Sort
View
TCC
2005
Springer
163views Cryptology» more  TCC 2005»
14 years 28 days ago
Adaptive Security of Symbolic Encryption
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
Daniele Micciancio, Saurabh Panjwani
CONCUR
2010
Springer
13 years 8 months ago
A Geometric Approach to the Problem of Unique Decomposition of Processes
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
Thibaut Balabonski, Emmanuel Haucourt
VLSISP
2011
231views Database» more  VLSISP 2011»
13 years 2 months ago
Loop Distribution and Fusion with Timing and Code Size Optimization
Loop distribution and loop fusion are two effective loop transformation techniques to optimize the execution of the programs in DSP applications. In this paper, we propose a new t...
Meilin Liu, Edwin Hsing-Mean Sha, Qingfeng Zhuge, ...
ICASSP
2008
IEEE
14 years 1 months ago
Distributed stereo image coding with improved disparity and noise estimation
Distributed coding of correlated grayscale stereo images is effectively addressed by a recently proposed codec that learns block-wise disparity at the decoder. Based on the Slepia...
David M. Chen, David P. Varodayan, Markus Flierl, ...
FCT
2009
Springer
14 years 2 months ago
Independence Results for n-Ary Recursion Theorems
The n-ary first and second recursion theorems formalize two distinct, yet similar, notions of self-reference. Roughly, the n-ary first recursion theorem says that, for any n algo...
John Case, Samuel E. Moelius