5624 search results - page 1037 / 1125 » On Conditional Covering Problem |
EUROCRYPT
2001
Springer
14 years 2 months ago
2001
Springer
At EuroCrypt’99, Paillier proposed a new encryption scheme based on higher residuosity classes. The new scheme was proven to be one-way under the assumption that computing N-resi...
MOBIDE
1999
ACM
14 years 2 months ago
1999
ACM
The first mass-produced pervasive computing devices are starting to appear—the AutoPC, the Internet-connected ScreenFridge, and the combination Microwave Oven/Home Banking term...
ICPP
1999
IEEE
14 years 2 months ago
1999
IEEE
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
COLT
1993
Springer
14 years 2 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
DBVIS
1993
14 years 2 months ago
1993
In this paper, we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provid...