263 search results - page 29 / 53 » Regret Bounds for Prediction Problems |
CVPR
2009
IEEE
15 years 5 months ago
2009
IEEE
Active learning strategies can be useful when manual labeling
effort is scarce, as they select the most informative
examples to be annotated first. However, for visual category
...
IJDMB
2010
13 years 8 months ago
2010
: We explore whether protein-RNA interfaces differ from non-interfaces in terms of their structural features and whether structural features vary according to the type of the bound...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
SDM
2010
SIAM
13 years 11 months ago
2010
SIAM
Lack of labeled training examples is a common problem for many applications. In the same time, there is usually an abundance of labeled data from related tasks. But they have diff...
INFOCOM
1993
IEEE
14 years 2 months ago
1993
IEEE
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in ATM networks with rate-controlled, non-work conserving servers. A theore...