2294 search results - page 320 / 459 » From Path Graphs to Directed Path Graphs |
123
click to vote
HOTNETS
2010
14 years 9 months ago
2010
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or nod...
161
Voted
ISCA
2012
IEEE
13 years 4 months ago
2012
IEEE
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
112
click to vote
CVPR
2006
IEEE
16 years 4 months ago
2006
IEEE
Multi-target tracking requires locating the targets and labeling their identities. The latter is a challenge when many targets, with indistinct appearances, frequently occlude one...
122
click to vote
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...
118
Voted
WADS
2005
Springer
15 years 8 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...