3208 search results - page 185 / 642 » A Lower Bound for Primality |
131
click to vote
AAECC
2006
Springer
16 years 15 days ago
2006
Springer
Abstract. We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially ...
173
click to vote
NIPS
2004
15 years 8 months ago
2004
We present a competitive analysis of Bayesian learning algorithms in the online learning setting and show that many simple Bayesian algorithms (such as Gaussian linear regression ...
172
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Let S = {si}iIN IN be a numerical semigroup. For si S, let (si) denote the number of pairs (si -sj, sj) S2 . When S is the Weierstrass semigroup of a family {Ci}iIN of one-point...
190
click to vote
JMLR
2010
15 years 1 months ago
2010
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
156
click to vote
GLOBECOM
2006
IEEE
16 years 17 days ago
2006
IEEE
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...