801 search results - page 45 / 161 » Minimal Locked Trees |
CCS
2007
ACM
15 years 3 months ago
2007
ACM
Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...
WDAG
2007
Springer
15 years 3 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
INFOCOM
1999
IEEE
15 years 2 months ago
1999
IEEE
We investigate the problem of optimal resource allocation for end-to-end QoS requirements on unicast paths and multicast trees. Specifically, we consider a framework in which reso...
ISPD
2010
ACM
15 years 4 months ago
2010
ACM
NBTI (Negative Bias Temperature Instability) has emerged as the dominant failure mechanism for PMOS in nanometer IC designs. However, its impact on one of the most important compo...