Sciweavers

1040 search results - page 46 / 208
» A New Periodicity Lemma
Sort
View
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
14 years 10 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
RECOMB
2006
Springer
14 years 10 months ago
A Study of Accessible Motifs and RNA Folding Complexity
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
Ydo Wexler, Chaya Ben-Zaken Zilberstein, Michal Zi...
STOC
2001
ACM
163views Algorithms» more  STOC 2001»
14 years 10 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
PPDP
2009
Springer
14 years 4 months ago
Reasoning with hypothetical judgments and open terms in hybrid
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
Amy P. Felty, Alberto Momigliano
LITP
1990
14 years 1 months ago
Infinite Traces
In this paper we provide several new results concerning word and matrix semigroup problems using counter automaton models. As a main result, we prove a new version of Post's c...
Paul Gastin