Sciweavers

700 search results - page 23 / 140
» et 2008
Sort
View
COLT
2008
Springer
13 years 9 months ago
High-Probability Regret Bounds for Bandit Online Linear Optimization
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...
TCBB
2008
73views more  TCBB 2008»
13 years 7 months ago
Nature Reserve Selection Problem: A Tight Approximation Algorithm
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
Magnus Bordewich, Charles Semple
TCS
2008
13 years 7 months ago
A note on the problem of reporting maximal cliques
Reporting the maximal cliques of a graph is a fundamental problem arising in many areas. This note bridges the gap between three papers addressing this problem: the original paper...
Frédéric Cazals, Chinmay Karande
TNN
2008
142views more  TNN 2008»
13 years 7 months ago
Multiclass Posterior Probability Support Vector Machines
Abstract--Tao et al. have recently proposed the posterior probability support vector machine (PPSVM) which uses soft labels derived from estimated posterior probabilities to be mor...
Mehmet Gönen, Ayse Gönül Tanugur, E...
DM
2008
95views more  DM 2008»
13 years 7 months ago
Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
In [2], Duffus et al. showed that every connected graph G which contains no induced subgraph isomorphic to a claw or a net is traceable. And they also showed that if a 2-connected...
Jun Fujisawa, Katsuhiro Ota, Takeshi Sugiyama, Mas...