Sciweavers

2252 search results - page 83 / 451
» Improving Random Forests
Sort
View
EC
2007
167views ECommerce» more  EC 2007»
13 years 8 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
COMBINATORICS
2000
89views more  COMBINATORICS 2000»
13 years 8 months ago
A Note on the Non-Colorability Threshold of a Random Graph
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...
Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C....
ICPR
2008
IEEE
14 years 2 months ago
Stereo matching using random walks
This paper presents a novel two-phase stereo matching algorithm using the random walks framework. At first, a set of reliable matching pixels is extracted with prior matrices de...
Rui Shen, Irene Cheng, Xiaobo Li, Anup Basu
ICDAR
2005
IEEE
14 years 1 months ago
Learning Diagram Parts with Hidden Random Fields
Many diagrams contain compound objects composed of parts. We propose a recognition framework that learns parts in an unsupervised way, and requires training labels only for compou...
Martin Szummer
DAGM
2008
Springer
13 years 10 months ago
Approximate Parameter Learning in Conditional Random Fields: An Empirical Investigation
We investigate maximum likelihood parameter learning in Conditional Random Fields (CRF) and present an empirical study of pseudo-likelihood (PL) based approximations of the paramet...
Filip Korc, Wolfgang Förstner