1760 search results - page 131 / 352 » Connected Set Cover Problem and Its Applications |
TCS
2008
13 years 8 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
INFOSCALE
2009
ACM
14 years 2 months ago
2009
ACM
Abstract. Application layer DDoS attacks, to which network layer solutions is not applicable as attackers are indistinguishable based on packets or protocols, prevent legitimate us...
USENIX
1996
13 years 9 months ago
1996
This paper describes a new method for providingtransparent fault tolerance for parallel applications on a network of workstations. We have designed our method in the context of sh...
AC
2006
Springer
13 years 8 months ago
2006
Springer
In this chapter, we characterize problems for web applications, examine existing testing techniques that are potentially applicable to the web environment, and introduce a strateg...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...