697 search results - page 42 / 140 » On the Theory of Average Case Complexity |
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—With the convergence of multimedia applications and wireless communications, there is an urgent need for developing new scheduling algorithms to support real-time traffic with ...
IJAC
2008
13 years 7 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...
IPCCC
2005
IEEE
14 years 1 months ago
2005
IEEE
The Double Authentication (DA) scheme presented in [1] is designed to provide security against impersonation attack to link state routing protocol at a lower computational cost as...
PE
2007
Springer
13 years 7 months ago
2007
Springer
Multicast-based inference has been proposed as a method of estimating average loss rates of internal network links, using end-to-end loss measurements of probes sent over a multic...