1298 search results - page 84 / 260 » The online set cover problem |
188
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Most models of utility elicitation in decision support and interactive optimization assume a predefined set of "catalog" features over which user preferences are express...
145
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
The problem of signature verification is considered within the bounds of the kernel-based methodology of pattern recognition, more specifically, SVM principle of machine learning....
166
click to vote
INFOCOM
2003
IEEE
16 years 3 days ago
2003
IEEE
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
231
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
162
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
We formulate the problem of scene summarization as selecting a set of images that efficiently represents the visual content of a given scene. The ideal summary presents the most i...