2252 search results - page 105 / 451 » Improving Random Forests |
SPAA
1993
ACM
14 years 7 days ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
COLT
2006
Springer
13 years 12 months ago
2006
Springer
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
NIPS
2004
13 years 9 months ago
2004
We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which use boos...
NAACL
2003
13 years 9 months ago
2003
Conditional random fields for sequence labeling offer advantages over both generative models like HMMs and classifiers applied at each sequence position. Among sequence labeling...
FGCS
2006
13 years 8 months ago
2006
We consider a model where commodity service providers are offering commodity computational services to a set of customers. We provide a solution for the efficient distribution of ...