1578 search results - page 67 / 316 » Direct Routing: Algorithms and Complexity |
CVPR
2004
IEEE
14 years 10 months ago
2004
IEEE
Edges in man-made environments, grouped according to vanishing point directions, provide single-view constraints that have been exploited before as a precursor to both scene under...
COCOON
2008
Springer
13 years 10 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
DBISP2P
2004
Springer
14 years 2 months ago
2004
Springer
Peer-to-Peer infrastructures are emerging as one of the important data management infrastructures in the World Wide Web. So far, however, most work has focused on simple P2P networ...
DAC
1997
ACM
14 years 28 days ago
1997
ACM
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
APPROX
2000
Springer
14 years 1 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...