7015 search results - page 318 / 1403 » Approximation algorithms for co-clustering |
203
click to vote
IJCAI
2001
15 years 8 months ago
2001
A new, general approach is described for approximate inference in first-order probabilistic languages, using Markov chain Monte Carlo (MCMC) techniques in the space of concrete po...
194
Voted
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
172
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Standard Reinforcement Learning (RL) aims to optimize decision-making rules in terms of the expected return. However, especially for risk-management purposes, other criteria such ...
168
Voted
IOR
2006
15 years 6 months ago
2006
For a discrete-time finite-state Markov chain, we develop an adaptive importance sampling scheme to estimate the expected total cost before hitting a set of terminal states. This s...
156
click to vote
IJBC
2007
15 years 6 months ago
2007
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...