Sciweavers

2252 search results - page 63 / 451
» Improving Random Forests
Sort
View
ICML
2010
IEEE
13 years 9 months ago
A Conditional Random Field for Multiple-Instance Learning
We present MI-CRF, a conditional random field (CRF) model for multiple instance learning (MIL). MI-CRF models bags as nodes in a CRF with instances as their states. It combines di...
Thomas Deselaers, Vittorio Ferrari
NAACL
2010
13 years 6 months ago
Products of Random Latent Variable Grammars
We show that the automatically induced latent variable grammars of Petrov et al. (2006) vary widely in their underlying representations, depending on their EM initialization point...
Slav Petrov
IAT
2006
IEEE
14 years 2 months ago
Using Prior Knowledge to Improve Distributed Hill Climbing
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
Roger Mailler
IJCNN
2006
IEEE
14 years 2 months ago
Reducing Uncertainties in Neural Network Jacobians and Improving Accuracy of Neural Network Emulations with NN Ensemble Approach
—A new application of the NN ensemble technique to improve the accuracy and stability of the calculation of NN emulation Jacobians is presented. The term “emulation” is defin...
Vladimir M. Krasnopolsky
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
13 years 11 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar