3008 search results - page 303 / 602 » Independence in connected graphs |
193
click to vote
COMCOM
2006
15 years 6 months ago
2006
In defending one's network against cyber attack, certain vulnerabilities may seem acceptable risks when considered in isolation. But an intruder can often infiltrate a seemin...
185
click to vote
TIT
2010
15 years 1 months ago
2010
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
199
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
203
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
227
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...