13214 search results - page 55 / 2643 » Pseudorandomness for network algorithms |
170
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
176
click to vote
IEEEPACT
2006
IEEE
16 years 6 days ago
2006
IEEE
Transactional memory is an attractive design concept for scalable multiprocessors because it offers efficient lock-free synchronization and greatly simplifies parallel software....
237
click to vote
E2EMON
2006
IEEE
16 years 6 days ago
2006
IEEE
Abstract— In our previous studies, we proposed ImTCP, an inline network measurement technique that can obtain available bandwidth information of the network path between sender a...
195
click to vote
APNOMS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. DoS(Denial of Service) / DDoS(Distributed Denial of Service) attacks threaten Internet security nowadays. However, the current Internet protocol and backbone network do n...
165
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
—Designing efficient scheduling algorithms is an important problem in a general class of networks with resourcesharing constraints, such as wireless networks and stochastic proc...