1949 search results - page 230 / 390 » Random graphs on surfaces |
152
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
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 ...
168
click to vote
UAI
2004
15 years 7 months ago
2004
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. ...
156
click to vote
JCO
2010
15 years 4 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
184
Voted
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
169
click to vote
SAC
2010
ACM
16 years 28 days ago
2010
ACM
Co-citation (number of nodes linking to both of a given pair of nodes) is often used heuristically to judge similarity between nodes in a complex network. We investigate the relat...