13214 search results - page 269 / 2643 » Pseudorandomness for network algorithms |
168
click to vote
IMC
2006
ACM
16 years 19 days ago
2006
ACM
The low price of commodity wireless LAN cards and access points (APs) has resulted in the rich proliferation of high density WLANs in enterprise, academic environments, and public ...
173
click to vote
SIGCOMM
2004
ACM
16 years 3 days ago
2004
ACM
The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. For example, knowing where bottlen...
203
click to vote
ANCS
2007
ACM
15 years 10 months ago
2007
ACM
The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detectio...
170
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
206
click to vote
FCS
2006
15 years 8 months ago
2006
: In this paper, functioning and interaction of distributed devices and concurrent algorithms are analyzed in the context of the theory of algorithms. Although different systems in...