Sciweavers

13 search results - page 1 / 3
» New Combinatorial Complete One-Way Functions
Sort
View
CORR
2008
Springer
109views Education» more  CORR 2008»
13 years 11 months ago
New Combinatorial Complete One-Way Functions
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we presen...
Arist Kojevnikov, Sergey I. Nikolenko
ASPLOS
2006
ACM
14 years 5 months ago
Combinatorial sketching for finite programs
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...
Armando Solar-Lezama, Liviu Tancau, Rastislav Bod&...
BMCBI
2006
108views more  BMCBI 2006»
13 years 11 months ago
A new pooling strategy for high-throughput screening: the Shifted Transversal Design
Background: In binary high-throughput screening projects where the goal is the identification of low-frequency events, beyond the obvious issue of efficiency, false positives and ...
Nicolas Thierry-Mieg
SIBGRAPI
1999
IEEE
14 years 3 months ago
Developing Morphological Building Blocks: From Design to Implementation
Abstract. Mathematical morphology has become a widely used technique for image processing and computer vision. Initially designed as a set theory, it was generalized to the set of ...
Marcos Cordeiro d'Ornellas, Rein van den Boomgaard
JAC
2008
14 years 18 days ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard