Sciweavers

322 search results - page 9 / 65
» Satisfiability Coding Lemma
Sort
View
ICTAC
2010
Springer
13 years 6 months ago
Formal Modelling of Separation Kernel Components
Abstract. Separation kernels are key components in embedded applications. Their small size and widespread use in high-integrity environments make them good targets for formal model...
Andrius Velykis, Leo Freitas
STOC
2001
ACM
163views Algorithms» more  STOC 2001»
14 years 7 months ago
Extractor codes
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
Amnon Ta-Shma, David Zuckerman
VMCAI
2004
Springer
14 years 25 days ago
Construction of a Semantic Model for a Typed Assembly Language
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
Gang Tan, Andrew W. Appel, Kedar N. Swadi, Dinghao...
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
14 years 7 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
CSB
2003
IEEE
113views Bioinformatics» more  CSB 2003»
14 years 23 days ago
An Optimal DNA Segmentation Based on the MDL Principle
: The biological world is highly stochastic and inhomogeneous in its behaviour. There are regions in DNA with high concentration of G or C bases; stretches of sequences with an abu...
Wojciech Szpankowski, Wenhui Ren, Lukasz Szpankows...