13214 search results - page 135 / 2643 » Pseudorandomness for network algorithms |
166
click to vote
INFOCOM
1999
IEEE
15 years 10 months ago
1999
IEEE
Video delivery from a server to a client across a network is an important component of many multimedia applications. While delivering a video stream across a resource constrained ...
173
click to vote
IJON
2008
15 years 6 months ago
2008
This paper proposed a kind of unsupervised learning neural network model, which has special structure and can realize an evaluation and classification of many groups by the compres...
186
click to vote
HIS
2009
15 years 4 months ago
2009
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
196
click to vote
CLUSTER
2002
IEEE
15 years 6 months ago
2002
IEEE
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
144
click to vote
LCN
2007
IEEE
16 years 22 days ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...