329 search results - page 25 / 66 » Probably Approximately Correct Learning |
EMNLP
2006
13 years 9 months ago
2006
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
PAMI
2011
13 years 2 months ago
2011
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
COLT
2007
Springer
14 years 1 months ago
2007
Springer
When comparing discrete probability distributions, natural measures of similarity are not p distances but rather are informationdivergences such as Kullback-Leibler and Hellinger. ...
MICCAI
2002
Springer
14 years 8 months ago
2002
Springer
Abstract. The paper introduces an algorithm which allows the automatic segmentation of multi channel magnetic resonance images. We extended the Expectation Maximization-Mean Field ...
PDCAT
2007
Springer
14 years 1 months ago
2007
Springer
When datasets are distributed on different sources, finding out their intersection while preserving the privacy of the datasets is a widely required task. In this paper, we addre...