Sciweavers

1632 search results - page 101 / 327
» On special numberings of hypergraphs
Sort
View
CISC
2007
Springer
111views Cryptology» more  CISC 2007»
16 years 24 days ago
Multivariates Polynomials for Hashing
We propose the idea of building a secure hash using quadratic or higher degree multivariate polynomials over a finite field as the compression function. We analyze some security ...
Jintai Ding, Bo-Yin Yang
COCOON
2007
Springer
16 years 24 days ago
"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for classes of polynomials f that have too few partial derivatives for the techn...
Maurice J. Jansen, Kenneth W. Regan
ECML
2007
Springer
16 years 24 days ago
Fast Optimization Methods for L1 Regularization: A Comparative Study and Two New Approaches
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...
Mark Schmidt, Glenn Fung, Rómer Rosales
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
16 years 24 days ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean
ICALP
2007
Springer
16 years 24 days ago
Perfect Information Stochastic Priority Games
We introduce stochastic priority games — a new class of perfect information stochastic games. These games can take two different, but equivalent, forms. In stopping priority ga...
Hugo Gimbert, Wieslaw Zielonka