117 search results - page 9 / 24 » Minimizing the Diameter of a Network Using Shortcut Edges |
ASUNAM
2010
IEEE
13 years 9 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
TPDS
2008
13 years 7 months ago
2008
To construct an efficient overlay network, the information of underlay is important. We consider using end-to-end measurement tools such as traceroute to infer the underlay topolog...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
ICIP
2002
IEEE
14 years 14 days ago
2002
IEEE
— A fast scheme for wavelet-domain interpolation of lost image blocks in wireless image transmission is presented in this paper. The algorithm is designed to be compatible with t...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...