2252 search results - page 210 / 451 » Improving Random Forests |
138
Voted
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
Recently, many global stereo methods have achieved good results by modeling a disparity surface as a Markov random field (MRF) and by solving an optimization problem with various ...
136
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
117
click to vote
HICSS
2007
IEEE
15 years 10 months ago
2007
IEEE
The interest in pair programming (PP) has increased recently, e.g. by the popularization of agile software development. However, many practicalities of PP are poorly understood. W...
127
click to vote
GROUP
2007
ACM
15 years 7 months ago
2007
ACM
We describe the design and evaluation of K-net, a social matching system to help people learn 'who knows what' in an organization by matching people with skills with tho...
151
click to vote
AAAI
1996
15 years 5 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...