1298 search results - page 41 / 260 » The online set cover problem |
FUIN
2010
14 years 7 months ago
2010
In this paper we study decidability of several extensions of P/T nets with name creation and/or replication. In particular, we study how to restrict the models of RN systems (P/T n...
ECCC
2006
14 years 9 months ago
2006
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
100
click to vote
STOC
2012
ACM
13 years 3 days ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
81
Voted
VLDB
2007
ACM
15 years 3 months ago
2007
ACM
For a large number of data management problems, it would be very useful to be able to obtain a few samples from a data set, and to use the samples to guess the largest (or smalles...
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Online boosting is one of the most successful online learning algorithms in computer vision. While many challenging online learning problems are inherently multi-class, online boo...