410 search results - page 34 / 82 » Upgrading Shortest Paths in Networks |
108
click to vote
ICANN
2001
Springer
15 years 6 months ago
2001
Springer
Auditory onsets are robust features of sounds: because the direct path from sound source to ear is the shortest path, the onset is unaffected by reverberation. Many cells in the c...
113
click to vote
ORL
2010
14 years 12 months ago
2010
The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we d...
156
click to vote
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
134
click to vote
JNW
2008
15 years 1 months ago
2008
Position based routing algorithms use the knowledge of the position of nodes for routing of packets in mobile ad-hoc networks. Previously proposed position based routing algorithms...
114
click to vote
PODC
2006
ACM
15 years 7 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...