1274 search results - page 223 / 255 » New Proofs for |
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
WISA
2009
Springer
14 years 3 months ago
2009
Springer
Power analysis has shown to be successful in breaking symmetric cryptographic algorithms implemented on low resource devices. Prompted by the breaking of many protected implementat...
DCOSS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. This paper presents a failure diagnosis algorithm for summarizing and generalizing patterns that lead to instances of anomalous behavior in sensor networks. Often multipl...
ACNS
2008
Springer
14 years 3 months ago
2008
Springer
Compliance storage is an increasingly important area for businesses faced with a myriad of new document retention regulations. Today, businesses have turned to Write-One Read Many ...
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...