8431 search results - page 1610 / 1687 » Algorithmically Independent Sequences |
SIGCOMM
2006
ACM
15 years 3 months ago
2006
ACM
An understanding of the topological structure of the Internet is needed for quite a number of networking tasks, e.g., making decisions about peering relationships, choice of upstr...
SPAA
2006
ACM
15 years 3 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...
105
click to vote
SPAA
2006
ACM
15 years 3 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
AMFG
2005
IEEE
15 years 3 months ago
2005
IEEE
2D intensity images and 3D shape models are both useful for face recognition, but in different ways. While algorithms have long been developed using 2D or 3D data, recently has see...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...