Sciweavers

87 search results - page 16 / 18
» GPUs: A Closer Look
Sort
View
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
15 years 3 months ago
Worst-Case to Average-Case Reductions Revisited
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...
Dan Gutfreund, Amnon Ta-Shma
MINENET
2006
ACM
15 years 3 months ago
Forensic analysis of autonomous system reachability
Security incidents have an adverse impact not only on end systems, but also on Internet routing, resulting in many out-of-reach prefixes. Previous work has looked at performance ...
D. K. Lee, Sue B. Moon, Taesang Choi, Taesoo Jeong
ICALP
2004
Springer
15 years 2 months ago
On the Expressive Power of Monadic Least Fixed Point Logic
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
Nicole Schweikardt
CRYPTO
2001
Springer
125views Cryptology» more  CRYPTO 2001»
15 years 1 months ago
Robust Non-interactive Zero Knowledge
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
Alfredo De Santis, Giovanni Di Crescenzo, Rafail O...
WEBNET
2001
14 years 10 months ago
Electronically Assisting Communication for Health Professionals
: New information and computing technologies offer cost efficient and effective learning opportunities for health care professionals. The Assisted Electronic Communication project ...
Peter Scott, Fiona Brooks, Kevin Quick, Maria Maci...