Sciweavers

5138 search results - page 595 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
CORR
2010
Springer
92views Education» more  CORR 2010»
15 years 7 months ago
Exact counting of Euler Tours for generalized series-parallel graphs
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...
Prasad Chebolu, Mary Cryan, Russell A. Martin
COMGEO
2004
ACM
15 years 6 months ago
A multi-dimensional approach to force-directed layouts of large graphs
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...
KAIS
2000
86views more  KAIS 2000»
15 years 6 months ago
A Mathematical Foundation for Improved Reduct Generation in Information Systems
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...
Janusz A. Starzyk, Dale E. Nelson, Kirk Sturtz
ALGORITHMICA
1998
103views more  ALGORITHMICA 1998»
15 years 6 months ago
On Bayes Methods for On-Line Boolean Prediction
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...
Nicolò Cesa-Bianchi, David P. Helmbold, San...
JSAC
1998
126views more  JSAC 1998»
15 years 6 months ago
Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models
Abstract—We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (...
Frank R. Kschischang, Brendan J. Frey