Sciweavers

503 search results - page 53 / 101
» If not now, when
Sort
View
JUCS
2007
88views more  JUCS 2007»
13 years 10 months ago
A Comparison of Various Methods for Computing Bounds for Positive Roots of Polynomials
Abstract: The recent interest in isolating real roots of polynomials has revived interest in computing sharp upper bounds on the values of the positive roots of polynomials. Until ...
Alkiviadis G. Akritas, Panagiotis S. Vigklas
AI
2002
Springer
13 years 10 months ago
Learning Bayesian networks from data: An information-theory based approach
This paper provides algorithms that use an information-theoretic analysis to learn Bayesian network structures from data. Based on our three-phase learning framework, we develop e...
Jie Cheng, Russell Greiner, Jonathan Kelly, David ...
CTW
2002
94views more  CTW 2002»
13 years 10 months ago
The Creation of a New Minor Event Coding System
Abstract: The present study began with an assessment of the reliability and usefulness of an existing minor event coding system in a British `highconsequence' industry. It was...
B. Wallace, A. Ross, J. B. Davies, L. Wright, M. W...
DKE
2002
218views more  DKE 2002»
13 years 10 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...
JSAC
1998
110views more  JSAC 1998»
13 years 10 months ago
Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm
—In this paper, we will describe the close connection between the now celebrated iterative turbo decoding algorithm of Berrou et al. and an algorithm that has been well known in ...
Robert J. McEliece, David J. C. MacKay, Jung-Fu Ch...