25 search results - page 4 / 5 » On Temporal Path Conditions in Dependence Graphs |
NIPS
2008
13 years 7 months ago
2008
Abstract: Structure learning of dynamic Bayesian networks provide a principled mechanism for identifying conditional dependencies in time-series data. This learning procedure assum...
CCS
2007
ACM
14 years 12 days ago
2007
ACM
: To understand overall vulnerability to network attack, one must consider attacker exploits not just in isolation, but also in combination. That is, one must analyze how low-level...
CVPR
2011
IEEE
13 years 2 months ago
2011
IEEE
A practical lipreading system can be considered either as subject dependent (SD) or subject-independent (SI). An SD system is user-specific, i.e., customized for some particular ...
CONCUR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
SIGMETRICS
2006
ACM
14 years 5 days ago
2006
ACM
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...