3668 search results - page 59 / 734 » Margin Distribution and Learning |
UAI
2004
15 years 1 months ago
2004
Recent research has made significant progress on the problem of bounding log partition functions for exponential family graphical models. Such bounds have associated dual paramete...
NIPS
2003
15 years 1 months ago
2003
Belief propagation on cyclic graphs is an efficient algorithm for computing approximate marginal probability distributions over single nodes and neighboring nodes in the graph. I...
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
Random Forests (RFs) have become commonplace
in many computer vision applications. Their
popularity is mainly driven by their high computational
efficiency during both training ...
111
click to vote
NIPS
2008
15 years 1 months ago
2008
The coding of information by neural populations depends critically on the statistical dependencies between neuronal responses. However, there is no simple model that can simultane...
ECCV
2002
Springer
16 years 1 months ago
2002
Springer
Numerous statistical learning methods have been developed for visual recognition tasks. Few attempts, however, have been made to address theoretical issues, and in particular, stud...