100 search results - page 17 / 20 » Least Cost Multicast Spanning Tree Algorithm for Local Compu... |
ALGORITHMICA
2002
13 years 7 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Enterprise networks are large and complex, and their designs must be frequently altered to adapt to changing organizational needs. The process of redesigning and reconfiguring ...
IWCMC
2006
ACM
14 years 1 months ago
2006
ACM
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
ICPP
1998
IEEE
13 years 11 months ago
1998
IEEE
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
DIALM
2005
ACM
13 years 9 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...