495 search results - page 27 / 99 » Approximation algorithms for budgeted learning problems |
UAI
1998
13 years 9 months ago
1998
In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a beli...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We present a distributed machine learning framework based on support vector machines that allows classification problems to be solved iteratively through parallel update algorithm...
AAAI
2007
13 years 10 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
EUROCOLT
1999
Springer
14 years 23 days ago
1999
Springer
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
ECCC
2008
13 years 8 months ago
2008
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...