537 search results - page 14 / 108 » A Call to Regularity |
ENTCS
2007
13 years 7 months ago
2007
We present a technique for inducing functional programs from few, well chosen input/output-examples (I/Oexamples). Potential applications for automatic program or algorithm induct...
TPDS
2002
13 years 7 months ago
2002
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
NAR
2007
13 years 7 months ago
2007
Clustered regularly interspaced short palindromic repeats (CRISPRs) constitute a particular family of tandem repeats found in a wide range of prokaryotic genomes (half of eubacter...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Regular Expressions (RegExes) are widely used in various applications to identify strings of text. Their flexibility, however, increases the complexity of the detection system and ...
CRYPTO
2012
Springer
11 years 10 months ago
2012
Springer
We provide a functional encryption system that supports functionality for regular languages. In our system a secret key is associated with a Deterministic Finite Automata (DFA) M....