Sciweavers

1888 search results - page 96 / 378
» Proof theory and computational analysis
Sort
View
90
Voted
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
15 years 7 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day
134
Voted
ICFEM
2009
Springer
14 years 10 months ago
Implementing a Direct Method for Certificate Translation
Abstract. Certificate translation is a method that transforms certificates of source programs into certificates of their compilation. It provides strong guarantees on low-level cod...
Gilles Barthe, Benjamin Grégoire, Sylvain H...
CACM
2010
97views more  CACM 2010»
14 years 10 months ago
Certified software
Certified software consists of a machine-executable program plus a formal machine-checkable proof that the software is free of bugs with respect to a claim of dependability. The c...
Zhong Shao
ICC
2011
IEEE
219views Communications» more  ICC 2011»
14 years 4 days ago
Deterministic Equivalents for the Performance Analysis of Isometric Random Precoded Systems
—We consider a general wireless channel model for different types of code-division multiple access (CDMA) and space-division multiple-access (SDMA) systems with isometric random ...
Jakob Hoydis, Romain Couillet, Mérouane Deb...
105
Voted
FSE
2005
Springer
117views Cryptology» more  FSE 2005»
15 years 6 months ago
Security Analysis of a 2/3-Rate Double Length Compression Function in the Black-Box Model
Abstract. In this paper, we propose a 2/3-rate double length compression function and study its security in the black-box model. We prove that to get a collision attack for the com...
Mridul Nandi, Wonil Lee, Kouichi Sakurai, Sangjin ...