Sciweavers

738 search results - page 72 / 148
» cases 2001
Sort
View
CC
2001
Springer
146views System Software» more  CC 2001»
15 years 2 months ago
Alias Analysis by Means of a Model Checker
We study the application of a standard model checker tool, Spin, to the well-known problem of computing a may-alias relation for a C program. A precise may-alias relation can signi...
Vincenzo Martena, Pierluigi San Pietro
COCOON
2001
Springer
15 years 2 months ago
On-Line Variable Sized Covering
We consider one-dimensional and multi-dimensional vector covering with variable sized bins. In the one-dimensional case, we consider variable sized bin covering with bounded item ...
Leah Epstein
COLT
2001
Springer
15 years 2 months ago
Intrinsic Complexity of Learning Geometrical Concepts from Positive Data
Intrinsic complexity is used to measure the complexity of learning areas limited by broken-straight lines (called open semi-hulls) and intersections of such areas. Any strategy le...
Sanjay Jain, Efim B. Kinber
CRYPTO
2001
Springer
97views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
Minimal Complete Primitives for Secure Multi-party Computation
Abstract. The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of com...
Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Raf...
CRYPTO
2001
Springer
136views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
Session-Key Generation Using Human Passwords Only
We present session-key generation protocols in a model where the legitimate parties share only a human-memorizable password. The security guarantee holds with respect to probabilis...
Oded Goldreich, Yehuda Lindell