Sciweavers

360 search results - page 47 / 72
» Explanations and Proof Trees
Sort
View
CSB
2005
IEEE
129views Bioinformatics» more  CSB 2005»
15 years 10 months ago
Rule Clustering and Super-rule Generation for Transmembrane Segments Prediction
The explanation of a decision is important for the acceptance of machine learning technology in bioinformatics applications such as protein structure prediction. In past research,...
Jieyue He, Bernard Chen, Hae-Jin Hu, Robert W. Har...
NOMS
2002
IEEE
130views Communications» more  NOMS 2002»
15 years 9 months ago
End-to-end service failure diagnosis using belief networks
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
Malgorzata Steinder, Adarshpal S. Sethi
APIN
2008
110views more  APIN 2008»
15 years 4 months ago
Explaining inferences in Bayesian networks
While Bayesian network (BN) can achieve accurate predictions even with erroneous or incomplete evidence, explaining the inferences remains a challenge. Existing approaches fall sh...
Ghim-Eng Yap, Ah-Hwee Tan, HweeHwa Pang
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 4 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
IS
2010
15 years 2 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley