We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...
Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze...
: In this paper we extend the theory of Radio Frequency (RF) propagation as it relates to propagation within metal circular pipes. This work is motivated by a need to understand th...
In current level set image segmentation methods, the number of regions is assumed to known beforehand. As a result, it remains constant during the optimization of the objective fun...
The paper presents a new sampling methodology for Bayesian networks that samples only a subset of variables and applies exact inference to the rest. Cutset sampling is a network s...
Abstract--This paper offers a new technique for spatially adaptive estimation. The local likelihood is exploited for nonparametric modeling of observations and estimated signals. T...