168
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
192
click to vote
BDIM
2008
IEEE
15 years 9 months ago
2008
IEEE
Information systems require awareness of risks and a good understanding of vulnerabilities and their exploitations. In this paper, we propose a novel approach for the systematic as...
207
Voted
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
200
Voted
BALT
2008
15 years 9 months ago
2008
Biomedical research on human subjects often requires a large amount of data to be collected by personal interviews, Internet based questionnaires, lab measurements or by extracting...
148
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f1, . . . , fk and ...