Sciweavers

23 search results - page 4 / 5
» Banded structure in binary matrices
Sort
View
WCC
2005
Springer
130views Cryptology» more  WCC 2005»
13 years 10 months ago
On the Design of Codes for DNA Computing
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
Olgica Milenkovic, Navin Kashyap
EVOW
2009
Springer
13 years 10 months ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...
FCCM
2006
IEEE
195views VLSI» more  FCCM 2006»
13 years 11 months ago
A Parallel Hardware Architecture for fast Gaussian Elimination over GF(2)
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
Andrey Bogdanov, M. C. Mertens
ICFEM
2010
Springer
13 years 3 months ago
Making the Right Cut in Model Checking Data-Intensive Timed Systems
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...
Rüdiger Ehlers, Michael Gerke 0002, Hans-J&ou...
ICISC
2009
146views Cryptology» more  ICISC 2009»
13 years 3 months ago
First CPIR Protocol with Data-Dependent Computation
We design a new (n, 1)-CPIR protocol BddCpir for -bit strings as a combination of a noncryptographic (BDD-based) data structure and a more basic cryptographic primitive (communicat...
Helger Lipmaa