215 search results - page 20 / 43 » The asymptotic number of binary codes and binary matroids |
ITC
2002
IEEE
15 years 4 months ago
2002
IEEE
1 This paper presents a test input data compression technique, which can be used to reduce input test data volume, test time, and the number of required tester channels. The techni...
ECIR
2010
Springer
15 years 1 months ago
2010
Springer
A promising way to accelerate similarity search is semantic hashing which designs compact binary codes for a large number of documents so that semantically similar documents are ma...
TEC
2008
14 years 11 months ago
2008
Recent research on compact genetic algorithms (cGAs) has proposed a number of evolutionary search methods with reduced memory requirements. In cGAs, the evolution of populations is...
253
click to vote
DNA
2011
Springer
13 years 11 months ago
2011
Springer
We study the potential for molecule recycling in chemical reaction systems and their DNA strand displacement realizations. Recycling happens when a product of one reaction is a rea...
121
click to vote
SACRYPT
2009
Springer
15 years 6 months ago
2009
Springer
The classical McEliece cryptosystem is built upon the class of Goppa codes, which remains secure to this date in contrast to many other families of codes but leads to very large pu...