Sciweavers

20294 search results - page 12 / 4059
» Algorithmic Information Theory
Sort
View
EUROCRYPT
2012
Springer
13 years 2 months ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
GECCO
2005
Springer
142views Optimization» more  GECCO 2005»
15 years 5 months ago
Goal-oriented preservation of essential genetic information by offspring selection
This contribution proposes an enhanced and generic selection model for Genetic Algorithms (GAs) and Genetic Programming (GP) which is able to preserve the alleles which are part o...
Michael Affenzeller, Stefan Wagner 0002, Stephan M...
CIKM
2005
Springer
15 years 5 months ago
On the estimation of frequent itemsets for data streams: theory and experiments
In this paper, we devise a method for the estimation of the true support of itemsets on data streams, with the objective to maximize one chosen criterion among {precision, recall}...
Pierre-Alain Laur, Richard Nock, Jean-Emile Sympho...
BVAI
2007
Springer
15 years 5 months ago
Classification with Positive and Negative Equivalence Constraints: Theory, Computation and Human Experiments
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
Rubi Hammer, Tomer Hertz, Shaul Hochstein, Daphna ...
ICIP
2008
IEEE
15 years 6 months ago
Multi-polarity text segmentation using graph theory
Text segmentation, or named text binarization, is usually an essential step for text information extraction from images and videos. However, most existing text segmentation method...
Jia Li, YongHong Tian, Tiejun Huang, Wen Gao