Sciweavers

274 search results - page 31 / 55
» On Random Sampling over Joins
Sort
View
UAI
2004
15 years 3 months ago
Bayesian Learning in Undirected Graphical Models: Approximate MCMC Algorithms
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...
Iain Murray, Zoubin Ghahramani
ICASSP
2010
IEEE
15 years 2 months ago
Training a support vector machine to classify signals in a real environment given clean training data
When building a classifier from clean training data for a particular test environment, knowledge about the environmental noise and channel should be taken into account. We propos...
Kevin Jamieson, Maya R. Gupta, Eric Swanson, Hyrum...
138
Voted
IVC
2008
138views more  IVC 2008»
15 years 1 months ago
Reconstructing relief surfaces
This paper generalizes Markov Random Field (MRF) stereo methods to the generation of surface relief (height) fields rather than disparity or depth maps. This generalization enable...
George Vogiatzis, Philip H. S. Torr, Steven M. Sei...
118
Voted
ACL
1994
15 years 3 months ago
A Markov Language Learning Model for Finite Parameter Spaces
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
Partha Niyogi, Robert C. Berwick
107
Voted
ICML
2004
IEEE
16 years 2 months ago
Approximate inference by Markov chains on union spaces
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Max Welling, Michal Rosen-Zvi, Yee Whye Teh