2434 search results - page 226 / 487 » Algorithmic Randomness of Closed Sets |
121
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
A performance and robustness study for on-line signature veri cation is presented. Experiments are carried out on the MCYT database comprising 16,500 signatures from 330 subjects,...
147
click to vote
EVOW
2004
Springer
15 years 9 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
122
click to vote
EOR
2006
15 years 4 months ago
2006
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
146
click to vote
JMLR
2012
13 years 6 months ago
2012
In this paper we address the problem of pool based active learning, and provide an algorithm, called UPAL, that works by minimizing the unbiased estimator of the risk of a hypothe...
125
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
We compare the practical performance of several recently proposed algorithms for active learning in the online classification setting. We consider two active learning algorithms (...