2252 search results - page 116 / 451 » Improving Random Forests |
AAAI
2011
12 years 8 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
ECCV
2000
Springer
14 years 10 months ago
2000
Springer
The problem of tracking pedestrians from a moving car is a challenging one. The Condensation tracking algorithm is appealing for its generality and potential for real-time implemen...
DATE
2009
IEEE
14 years 2 months ago
2009
IEEE
—Future computing systems will feature many cores that run fast, but might show more faults compared to existing CMOS technologies. New software methodologies must be adopted to ...