Sciweavers

2294 search results - page 130 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
CATS
2008
14 years 11 months ago
An ILP for the metro-line crossing problem
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
Matthew Asquith, Joachim Gudmundsson, Damian Merri...
NSDI
2007
15 years 7 days ago
R-BGP: Staying Connected in a Connected World
Many studies show that, when Internet links go up or down, the dynamics of BGP may cause several minutes of packet loss. The loss occurs even when multiple paths between the sende...
Nate Kushman, Srikanth Kandula, Dina Katabi, Bruce...
ICPR
2008
IEEE
15 years 11 months ago
On efficient Viterbi decoding for hidden semi-Markov models
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...
Bonnie K. Ray, Jianying Hu, Ritendra Datta
DM
2008
97views more  DM 2008»
14 years 10 months ago
On uniquely k-determined permutations
Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce the notion of uniquely k-determined permutations. We give two criteria f...
Sergey V. Avgustinovich, Sergey Kitaev
IICS
2003
Springer
15 years 3 months ago
Where to Start Browsing the Web?
Both human users and crawlers face the problem of finding good start pages to explore some topic. We show how to assist in qualifying pages as start nodes by link-based ranking al...
Dániel Fogaras