14518 search results - page 103 / 2904 » Two Problems for Sophistication |
140
click to vote
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
114
click to vote
ASAP
2000
IEEE
15 years 7 months ago
2000
IEEE
MicroSIMD architectures incorporating subword parallelism are very efficient for application-specific media processors as well as for fast multimedia information processing in gen...
108
Voted
CTRSA
2008
Springer
15 years 5 months ago
2008
Springer
In the 1980s, Yao presented a very efficient constant-round secure two-party computation protocol withstanding semi-honest adversaries, which is based on so-called garbled circuits...
146
click to vote
CCCG
2007
15 years 4 months ago
2007
We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested in minimizing the number of cache faults caused whe...
130
click to vote
AIPS
1996
15 years 4 months ago
1996
Learning from experimentation allows a system to acquire planning domain knowledge by correcting its knowledge when an action execution fails. Experiments are designed and planned...