130 search results - page 13 / 26 » Optimal Lower Bounds on Regular Expression Size Using Commun... |
CRYPTO
2001
Springer
14 years 1 days ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
APLAS
2005
ACM
14 years 1 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
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...