1172 search results - page 75 / 235 » Path Algorithms on Regular Graphs |
89
Voted
NIPS
2008
15 years 1 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
124
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
109
Voted
ICOIN
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
75
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
112
Voted
ACSAC
2005
IEEE
15 years 6 months ago
2005
IEEE
The typical means by which an attacker breaks into a network is through a chain of exploits, where each exploit in the chain lays the groundwork for subsequent exploits. Such a ch...