168 search results - page 9 / 34 » An Upper Bound for B2[2] Sequences |
JCSS
2002
13 years 7 months ago
2002
We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecu...
TIT
1998
13 years 7 months ago
1998
— This paper considers estimation of a univariate density from an individual numerical sequence. It is assumed that 1) the limiting relative frequencies of the numerical sequence...
NIPS
2008
13 years 9 months ago
2008
Large-margin structured estimation methods minimize a convex upper bound of loss functions. While they allow for efficient optimization algorithms, these convex formulations are n...
NIPS
2004
13 years 9 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
DCC
2010
IEEE
13 years 8 months ago
2010
IEEE
In the study of multiple-access in the collision channel, conflict-avoiding code is used to guarantee that each transmitting user can send at least one packet successfully in the w...