168 search results - page 8 / 34 » An Upper Bound for B2[2] Sequences |
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
DCC
2007
IEEE
14 years 7 months ago
2007
IEEE
We address the problem of a finite delay constraint in an arithmetic coding system. Due to the nature of the arithmetic coding process, source sequences causing arbitrarily large ...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
ICCV
2009
IEEE
13 years 5 months ago
2009
IEEE
The varying object appearance and unlabeled data from new frames are always the challenging problem in object tracking. Recently machine learning methods are widely applied to tra...
JCO
2006
13 years 8 months ago
2006
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...