Sciweavers

194 search results - page 23 / 39
» Better polynomials for GNFS
Sort
View
ICPR
2008
IEEE
14 years 4 months ago
Generalized Chebyshev Kernels for Support Vector Classification
In this paper, a method to generalize previously proposed Chebyshev Kernel function is presented for Support Vector Classification in order to obtain more robust and higher classi...
Sedat Ozer, Chi Hau Chen
ICC
2007
IEEE
14 years 4 months ago
Some Results on the Binary Minimum Distance of Reed-Solomon Codes and Block Turbo Codes
— We study the minimum distance of the binary expansion of high-rate Reed-Solomon (RS) codes and product codes in the polynomial basis and show that the binary codes obtained in ...
Raphaël Le Bidan, Ramesh Pyndiah, Patrick Add...
CEC
2005
IEEE
14 years 3 months ago
On the complexity of overcoming gaps with isotropic mutations and elitist selection
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
Jens Jägersküpper
SAT
2005
Springer
124views Hardware» more  SAT 2005»
14 years 3 months ago
An Improved Upper Bound for SAT
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...
Evgeny Dantsin, Alexander Wolpert
VLDB
1998
ACM
136views Database» more  VLDB 1998»
14 years 1 months ago
Materialized View Selection for Multidimensional Datasets
To fulfill the requirement of fast interactive multidimensional data analysis, database systems precompute aggregate views on some subsets of dimensions and their corresponding hi...
Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton