5214 search results - page 154 / 1043 » The Online Specialization Problem |
130
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
126
click to vote
DM
2000
15 years 3 months ago
2000
This paper discusses investigations of sequences of natural numbers which count the orbits of an in nite permutation group on n-sets or n-tuples. It surveys known results on the g...
131
click to vote
IOR
2010
15 years 2 months ago
2010
We study an inventory system under periodic review in the presence of two suppliers (or delivery modes). The emergency supplier has a shorter lead-time than the regular supplier, ...
176
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
In this paper, we address the problem of learning an
adaptive appearance model for object tracking. In particular,
a class of tracking techniques called “tracking by detectionâ...
132
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...