Sciweavers

876 search results - page 6 / 176
» New Results for the Martin Polynomial
Sort
View
DAS
2008
Springer
13 years 10 months ago
New Oversampling Approaches Based on Polynomial Fitting for Imbalanced Data Sets
In classification tasks, class-modular strategy has been widely used. It has outperformed classical strategy for pattern classification task in many applications [1]. However, in ...
Sami Gazzah, Najoua Essoukri Ben Amara
ECCC
2011
187views ECommerce» more  ECCC 2011»
13 years 3 days ago
In Brute-Force Search of Correlation Bounds for Polynomials
We report on some initial results of a brute-force search for determining the maximum correlation between degree-d polynomials modulo p and the n-bit mod q function. For various s...
Frederic Green, Daniel Kreymer, Emanuele Viola
EUROCRYPT
1999
Springer
14 years 26 days ago
Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes
Abstract. This paper describes new methods for fast correlation attacks, based on the theory of convolutional codes. They can be applied to arbitrary LFSR feedback polynomials, in ...
Thomas Johansson, Fredrik Jönsson
ICCS
1998
Springer
14 years 24 days ago
Matching in Description Logics: Preliminary Results
Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of concept description languages (description logics),...
Franz Baader, Alexander Borgida, Deborah L. McGuin...
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
13 years 8 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof