We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
Pawel Gajer, Michael T. Goodrich, Stephen G. Kobou...
When data sets are analyzed, statistical pattern recognition is often used to find the information hidden in the data. Another approach to information discovery is data mining. Dat...
We examine a general Bayesian framework for constructing on-line prediction algorithms in the experts setting. These algorithms predict the bits of an unknown Boolean sequence usin...
Abstract—We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (...