162 search results - page 29 / 33 » The Induced Disjoint Paths Problem |
ACSD
2009
IEEE
13 years 10 months ago
2009
IEEE
Protocol conversion deals with the automatic synthesis of an additional component, often referred to as an adaptor or a converter, to bridge mismatches between interacting compone...
ICALP
1998
Springer
13 years 11 months ago
1998
Springer
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
IEEEARES
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Attack Graphs are an important support for assessment and subsequent improvement of network security. They reveal possible paths an attacker can take to break through se...
ISCA
2008
IEEE
14 years 1 months ago
2008
IEEE
Architectures that exploit control independence (CI) promise to remove in-order fetch bottlenecks, like branch mispredicts, instruction-cache misses and fetch unit stalls, from th...