2652 search results - page 244 / 531 » Path Differentials and Applications |
153
click to vote
ICNP
2005
IEEE
16 years 5 days ago
2005
IEEE
By allowing end hosts to make routing decisions at the application level, different overlay networks may unintentionally interfere with each other. This paper describes how multip...
163
click to vote
ISMIR
2005
Springer
16 years 2 days ago
2005
Springer
We present MATCH, a toolkit for aligning audio recordings of different renditions of the same piece of music, based on an efficient implementation of a dynamic time warping algor...
167
click to vote
SIGCOMM
2004
ACM
16 years 6 hour ago
2004
ACM
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
153
click to vote
SIGMETRICS
2004
ACM
16 years 5 hour ago
2004
ACM
We study the problem of locating in space and over time a network path’s tight link, that is the link with the least available bandwidth on the path. Tight link localization ben...
211
click to vote
KDD
2004
ACM
15 years 12 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...