10054 search results - page 1839 / 2011 » On the Complexity of Function Learning |
200
click to vote
CRYPTO
2003
Springer
16 years 5 days ago
2003
Springer
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
156
click to vote
ICCSA
2003
Springer
16 years 4 days ago
2003
Springer
A problem of eliminating the unwanted time-harmonic noise on a predetermined region of interest is solved by active means, i.e., by introducing the additional sources of sound, cal...
194
click to vote
CSFW
2002
IEEE
15 years 12 months ago
2002
IEEE
We describe a protocol design process, and illustrate its use by creating ATSPECT, an Authentication Test-based Secure Protocol for Electronic Commerce Transactions. The design pr...
198
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
220
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
This paper presents a novel software engineering approach for developing a dynamic web interface that meets the quality criterion of “WYDIWYS” - What You Do Is What You See. T...