2294 search results - page 200 / 459 » From Path Graphs to Directed Path Graphs |
GCC
2005
Springer
15 years 3 months ago
2005
Springer
Building a topology-aware peer-to-peer overlay network can bring many advantages, such as providing locality-aware connectivity and reducing routing path length. While its benefit...
VLDB
2004
ACM
15 years 3 months ago
2004
ACM
Different models have been proposed recently for representing temporal data, tracking historical information, and recovering the state of the document as of any given time, in XM...
71
Voted
SIBGRAPI
2000
IEEE
15 years 2 months ago
2000
IEEE
This article deals with a new segmentation approach applied to unconstrained handwritten digits. The novelty of the proposed algorithm is based on the combination of two types of s...
ISAAC
1999
Springer
15 years 2 months ago
1999
Springer
We consider online routing algorithms for routing between the vertices of embedded planar straight line graphs. Our results include (1) two deterministic memoryless routing algorit...
76
Voted
ENTCS
2007
14 years 10 months ago
2007
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...