1447 search results - page 176 / 290 » Graphs and Path Equilibria |
142
click to vote
ISCC
2005
IEEE
15 years 10 months ago
2005
IEEE
We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is in...
171
click to vote
IEEEMSP
2002
IEEE
15 years 9 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
151
click to vote
INFOCOM
1998
IEEE
15 years 9 months ago
1998
IEEE
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...
138
click to vote
NSDI
2007
15 years 7 months ago
2007
Many studies show that, when Internet links go up or down, the dynamics of BGP may cause several minutes of packet loss. The loss occurs even when multiple paths between the sende...
148
click to vote
IPMI
2007
Springer
16 years 5 months ago
2007
Springer
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...