Sciweavers

564 search results - page 81 / 113
» Approximation algorithms for restricted Bayesian network str...
Sort
View
ECCC
2006
145views more  ECCC 2006»
15 years 17 days ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
126
Voted
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
14 years 10 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
UAI
2004
15 years 1 months ago
Dependent Dirichlet Priors and Optimal Linear Estimators for Belief Net Parameters
A Bayesian belief network is a model of a joint distribution over a finite set of variables, with a DAG structure representing immediate dependencies among the variables. For each...
Peter Hooper
95
Voted
UAI
1997
15 years 1 months ago
Score and Information for Recursive Exponential Models with Incomplete Data
Recursive graphical models usually underlie the statistical modelling concerning probabilistic expert systems based on Bayesian networks. This paper de nes a version of these mode...
Bo Thiesson
IACR
2011
124views more  IACR 2011»
14 years 6 days ago
Zero-Correlation Linear Cryptanalysis of Block Ciphers
Linear cryptanalysis, along with differential cryptanalysis, is an important tool to evaluate the security of block ciphers. This work introduces a novel extension of linear crypt...
Andrey Bogdanov, Vincent Rijmen