Sciweavers

3898 search results - page 189 / 780
» On the Bit Extraction Problem
Sort
View
111
Voted
GECCO
2006
Springer
195views Optimization» more  GECCO 2006»
15 years 6 months ago
Studying XCS/BOA learning in Boolean functions: structure encoding and random Boolean functions
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
Martin V. Butz, Martin Pelikan
ICIP
2003
IEEE
16 years 4 months ago
LLRT based detection of LSB hiding
In this paper we consider a hypothesis testing approach for detection of hiding in the least significant bit (LSB). This steganalysis problem is a composite hypothesis testing pro...
Kenneth Sullivan, Onkar Dabeer, Upamanyu Madhow, B...
ICALP
2010
Springer
15 years 7 months ago
Mean-Payoff Games and Propositional Proofs
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
Albert Atserias, Elitza N. Maneva
COCOON
2000
Springer
15 years 7 months ago
Recent Progress and Prospects for Integer Factorisation Algorithms
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...
Richard P. Brent
JCSS
2007
88views more  JCSS 2007»
15 years 2 months ago
Counting lattice vectors
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is ...
Denis Xavier Charles