2310 search results - page 302 / 462 » Coloring Random Graphs |
107
click to vote
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
114
click to vote
SODA
2001
ACM
15 years 3 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 ...
120
click to vote
UAI
2004
15 years 3 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. ...
129
Voted
ECCV
2006
Springer
16 years 4 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...
107
Voted
SAC
2010
ACM
15 years 9 months 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...