Sciweavers

1523 search results - page 272 / 305
» The Computational Complexity of Linear Optics
Sort
View
SIGGRAPH
1995
ACM
13 years 11 months ago
A signal processing approach to fair surface design
In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals...
Gabriel Taubin
CRYPTO
2011
Springer
243views Cryptology» more  CRYPTO 2011»
12 years 7 months ago
Memory Delegation
We consider the problem of delegating computation, where the delegator doesn’t even know the input to the function being delegated, and runs in time significantly smaller than ...
Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ra...
DCC
2002
IEEE
14 years 7 months ago
Rate-Based versus Distortion-Based Optimal Joint Source-Channel Coding
- We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error c...
Raouf Hamzaoui, Vladimir Stankovic
DATE
2010
IEEE
140views Hardware» more  DATE 2010»
14 years 21 days ago
Variation-aware interconnect extraction using statistical moment preserving model order reduction
—1 In this paper we present a stochastic model order reduction technique for interconnect extraction in the presence of process variabilities, i.e. variation-aware extraction. It...
Tarek A. El-Moselhy, Luca Daniel
CRYPTO
2010
Springer
188views Cryptology» more  CRYPTO 2010»
13 years 8 months ago
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
Homomorphic encryption (HE) schemes enable computing functions on encrypted data, by means of a public Eval procedure that can be applied to ciphertexts. But the evaluated ciphert...
Craig Gentry, Shai Halevi, Vinod Vaikuntanathan