169 search results - page 14 / 34 » Counting paths in digraphs |
MFCS
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...
ENGL
2007
13 years 9 months ago
2007
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
SIGCOMM
2004
ACM
14 years 3 months ago
2004
ACM
Routing protocols for wireless ad hoc networks have traditionally focused on finding paths with minimum hop count. However, such paths can include slow or lossy links, leading to...
ICNP
1997
IEEE
14 years 1 months ago
1997
IEEE
Transmission ofmultimedia streams imposesa minimum-bandwidth requirementon the path being usedto ensureend-to-endQuality-ofService (QoS) guarantees. While any shortest-path algori...
MLDM
2007
Springer
14 years 4 months ago
2007
Springer
In this paper we show how frequent sequence mining (FSM) can be applied to data produced by monitoring distributed enterprise applications. In particular we show how we applied FSM...