Sciweavers

886 search results - page 108 / 178
» Reasoning with contextual graphs
Sort
View
IPL
2006
97views more  IPL 2006»
15 years 4 months ago
A fixed-parameter tractability result for multicommodity demand flow in trees
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
Jiong Guo, Rolf Niedermeier
IJAR
2010
152views more  IJAR 2010»
15 years 2 months ago
Structural-EM for learning PDG models from incomplete data
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
Jens D. Nielsen, Rafael Rumí, Antonio Salme...
BIOCOMP
2010
15 years 23 days ago
A Network-based Approach to Classify Disease Stages of Prostate Cancer Using Quantitative Network Measures
Abstract-- This study deals with investigating the classification performance of information-theoretic measures when applied to complex biological networks. In particular, our aim ...
Laurin A. J. Mueller, Karl G. Kugler, Andreas Dand...
BMCBI
2011
14 years 10 months ago
Ultra-fast sequence clustering from similarity networks with SiLiX
Background: The number of gene sequences that are available for comparative genomics approaches is increasing extremely quickly. A current challenge is to be able to handle this h...
Vincent Miele, Simon Penel, Laurent Duret
128
Voted
CADE
2009
Springer
16 years 4 months ago
An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound meth...
Florian Widmann, Rajeev Goré