13214 search results - page 365 / 2643 » Pseudorandomness for network algorithms |
139
click to vote
HICSS
2003
IEEE
16 years 3 days ago
2003
IEEE
In this paper, we tackle the problem of topology formation in Bluetooth Wireless Personal Area Networks (BTWPANs). We first overview and extend a previously proposed centralized ...
191
click to vote
ICDCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider efficient communication schemes based on both network-supported and application-level multicast techniques for content-based publication-subscription systems. We show...
214
click to vote
NEUROSCIENCE
2001
Springer
15 years 11 months ago
2001
Springer
Biological networks are capable of gradual learning based on observing a large number of exemplars over time as well as of rapidly memorizing specific events as a result of a sin...
176
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
A fault ring is a connection of only nonfaulty adjacent nodes and links such that the interior of the ring contains only faulty components. This paper proposes two wormhole routin...
153
click to vote
INFOCOM
1997
IEEE
15 years 11 months ago
1997
IEEE
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...