Sciweavers

741 search results - page 61 / 149
» A Markov random field model for term dependencies
Sort
View
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 7 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
ECCV
2004
Springer
16 years 8 months ago
MCMC-Based Multiview Reconstruction of Piecewise Smooth Subdivision Curves with a Variable Number of Control Points
We investigate the automated reconstruction of piecewise smooth 3D curves, using subdivision curves as a simple but flexible curve representation. This representation allows taggin...
Michael Kaess, Rafal Zboinski, Frank Dellaert
UM
2009
Springer
15 years 10 months ago
History Dependent Recommender Systems Based on Partial Matching
Abstract. This paper focuses on the utilization of the history of navigation within recommender systems. It aims at designing a collaborative recommender based on Markov models rel...
Armelle Brun, Geoffray Bonnin, Anne Boyer
PAMI
2002
108views more  PAMI 2002»
15 years 5 months ago
Approximate Bayes Factors for Image Segmentation: The Pseudolikelihood Information Criterion (PLIC)
We propose a method for choosing the number of colors or true gray levels in an image; this allows fully automatic segmentation of images. Our underlying probability model is a hid...
Derek C. Stanford, Adrian E. Raftery
ICCV
2003
IEEE
16 years 8 months ago
Towards a Mathematical Theory of Primal Sketch and Sketchability
In this paper, we present a mathematical theory for Marr's primal sketch. We first conduct a theoretical study of the descriptive Markov random field model and the generative...
Cheng-en Guo, Song Chun Zhu, Ying Nian Wu