242 search results - page 44 / 49 » Auctions with Arbitrary Deals |
CRYPTO
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. While there is a great deal of sophistication in modern cryptology, simple (and simplistic) explanations of cryptography remain useful and perhaps necessary. Many of the ...
SIGSOFT
1998
ACM
15 years 1 months ago
1998
ACM
Understanding large software systems is difficult. Traditionally, automated tools are used to assist program understanding. However, the representations constructed by these tool...
STOC
1996
ACM
15 years 1 months ago
1996
ACM
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
109
click to vote
ASPLOS
1992
ACM
15 years 1 months ago
1992
ACM
Current technology trends make it possible to build communication networks that can support high performance distributed computing. This paper describes issues in the design of a ...
KDD
2010
ACM
15 years 1 months ago
2010
ACM
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...