117 search results - page 13 / 24 » On Superlinear Lower Bounds in Complexity Theory |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
OPODIS
2007
13 years 9 months ago
2007
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
MICAI
2005
Springer
14 years 1 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
EUROCRYPT
2012
Springer
11 years 10 months ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
SIGMETRICS
2005
ACM
14 years 1 months ago
2005
ACM
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...