Sciweavers

1089 search results - page 31 / 218
» Bounds on generalized Frobenius numbers
Sort
View
FOCI
2007
IEEE
14 years 2 months ago
On the Convergence of Immune Algorithms
Immune Algorithms have been used widely and successfully in many computational intelligence areas including optimization. Given the large number of variants of each operator of thi...
Vincenzo Cutello, Giuseppe Nicosia, Mario Romeo, P...
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 4 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...
STACS
1995
Springer
13 years 11 months ago
Generalized Scans and Tri-Diagonal Systems
Motivatedby the analysis of known parallel techniques for the solution of linear tridiagonal system, we introduce generalized scans, a class of recursively de ned lengthpreserving...
Paul F. Fischer, Franco P. Preparata, John E. Sava...
COLT
2007
Springer
14 years 1 months ago
Prediction by Categorical Features: Generalization Properties and Application to Feature Ranking
We describe and analyze a new approach for feature ranking in the presence of categorical features with a large number of possible values. It is shown that popular ranking criteria...
Sivan Sabato, Shai Shalev-Shwartz
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir