Sciweavers

168 search results - page 23 / 34
» An Upper Bound for B2[2] Sequences
Sort
View
CORR
2006
Springer
96views Education» more  CORR 2006»
15 years 6 months ago
Metric entropy in competitive on-line prediction
Competitive on-line prediction (also known as universal prediction of individual sequences) is a strand of learning theory avoiding making any stochastic assumptions about the way...
Vladimir Vovk
TIT
1998
96views more  TIT 1998»
15 years 6 months ago
Nonparametric Estimation of Transfer Functions: Rates of Convergence and Adaptation
Abstract— The paper deals with estimating transfer functions of stable linear time-invariant systems under stochastic assumptions. We adopt a nonparametric minimax approach for m...
Alexander Goldenshluger
AI
1998
Springer
15 years 6 months ago
Worst-Case Analysis of the Perceptron and Exponentiated Update Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. This paper demonstrates worst-case upper bounds on the absolute loss for the Perceptron le...
Tom Bylander
ICDM
2007
IEEE
254views Data Mining» more  ICDM 2007»
16 years 27 days ago
Sampling for Sequential Pattern Mining: From Static Databases to Data Streams
Sequential pattern mining is an active field in the domain of knowledge discovery. Recently, with the constant progress in hardware technologies, real-world databases tend to gro...
Chedy Raïssi, Pascal Poncelet
189
Voted
WAIFI
2007
Springer
175views Mathematics» more  WAIFI 2007»
16 years 24 days ago
Attacking the Filter Generator over GF (2 m )
We consider the filter generator over GF(2m ) consisting of a linear feedback shift register of length k that generates a maximal length linear sequence of period 2mk − 1 over G...
Sondre Rønjom, Tor Helleseth