5214 search results - page 107 / 1043 » The Online Specialization Problem |
122
Voted
PVLDB
2010
15 years 2 months ago
2010
Despite the huge amount of recent research efforts on entity resolution (matching) there has not yet been a comparative evaluation on the relative effectiveness and efficiency of ...
140
click to vote
ESA
2004
Springer
15 years 7 months ago
2004
Springer
The main contribution of this paper is an optimal bounded space online algorithm for variable-sized multidimensional packing. In this problem, hyperboxes must be packed in ddimens...
128
Voted
ORL
2010
14 years 10 months ago
2010
Recently, there has been a surge of interest in algorithms that allocate advertisement space in an online revenue-competitive manner. Most such algorithms, however, assume a pay-a...
185
Voted
CVPR
2010
IEEE
16 years 3 days ago
2010
IEEE
Tracking-by-detection is increasingly popular in order to tackle the visual tracking problem. Existing adaptive methods suffer from the drifting problem, since they rely on selfup...
122
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...