4212 search results - page 177 / 843 » On Compressible Pairings and Their Computation |
161
click to vote
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
Oblivious transfer (OT) is an essential building block for secure multiparty computation when there is no honest majority. In this setting, current protocols for n 3 parties requ...
162
click to vote
SIGMETRICS
1998
ACM
15 years 10 months ago
1998
ACM
While much work has been devoted to the study of cache behavior during the execution of codes with regular access patterns, little attention has been paid to irregular codes. An i...
145
click to vote
SIGCSE
2002
ACM
15 years 6 months ago
2002
ACM
We describe a course for non-majors that teaches computer science concepts and programming by creating simple animations and building 2D and 3D virtual worlds. Students work with ...
172
click to vote
VIS
2007
IEEE
16 years 7 months ago
2007
IEEE
The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and th...
175
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...