Sciweavers

322 search results - page 13 / 65
» Satisfiability Coding Lemma
Sort
View
COCO
2005
Springer
124views Algorithms» more  COCO 2005»
14 years 1 months ago
Tolerant Versus Intolerant Testing for Boolean Properties
A property tester with high probability accepts inputs satisfying a given property and rejects inputs that are far from satisfying it. A tolerant property tester, as defined by P...
Eldar Fischer, Lance Fortnow
ACSD
2003
IEEE
105views Hardware» more  ACSD 2003»
13 years 11 months ago
Detecting State Coding Conflicts in STG Unfoldings Using SAT
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
TIT
2008
87views more  TIT 2008»
13 years 7 months ago
Coding Theorems on the Threshold Scheme for a General Source
In this paper, coding theorems on the (t; m)-threshold scheme for a general source are discussed, where m means the number of the shares and t means a threshold. The (t; m)-thresho...
Hiroki Koga
ICALP
2005
Springer
14 years 1 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
CORR
2008
Springer
62views Education» more  CORR 2008»
13 years 7 months ago
On Unique Decodability
In this paper, we propose a revisitation of the topic of unique decodability and of some fundamental theorems of lossless coding. It is widely believed that, for any discrete sourc...
Marco Dalai, Riccardo Leonardi