15485 search results - page 369 / 3097 » Computing Optimal Subsets |
161
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
150
click to vote
STOC
2000
ACM
15 years 11 months ago
2000
ACM
We consider a new model for computing with uncertainty. It is desired to compute a function f X1; : : : ; Xn where X1; : : : ; Xn are unknown, but guaranteed to lie in speci ed i...
182
click to vote
DAC
1999
ACM
15 years 11 months ago
1999
ACM
Buffer insertion has become a critical step in deep submicron design, and several buffer insertion/sizing algorithms have been proposed in the literature. However, most of these m...
194
click to vote
DATE
1997
IEEE
15 years 11 months ago
1997
IEEE
In modern computer systems the performance is dominated by the memory performance. Currently, there is neither a systematic design methodology nor a tool for the design of memory ...
155
Voted
POPL
1996
ACM
15 years 11 months ago
1996
ACM
This paper presents program analyses and transformations that discover a general class of auxiliary information for any incremental computation problem. Combining these techniques...