3946 search results - page 730 / 790 » The computational complexity of choice sets |
153
click to vote
SIGGRAPH
1998
ACM
15 years 10 months ago
1998
ACM
We present a new method for creating an image with a handpainted appearance from a photograph, and a new approach to designing styles of illustration. We “paint” an image with...
228
click to vote
QCQC
1998
Springer
15 years 10 months ago
1998
Springer
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classi...
204
click to vote
HPCA
1996
IEEE
15 years 10 months ago
1996
IEEE
This paper compares several implementations of entry consistency (EC) and lazy release consistency (LRC), two relaxed memory models in use with software distributed shared memory ...
200
click to vote
SIGGRAPH
1992
ACM
15 years 10 months ago
1992
ACM
This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object. Representing models at var...
157
click to vote
ASIACRYPT
2007
Springer
15 years 10 months ago
2007
Springer
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...