Sciweavers

1647 search results - page 173 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
EUROCRYPT
2012
Springer
13 years 7 months ago
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
We describe a compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan’s (DGHV) fully homomorphic scheme over the integers from ˜O(...
Jean-Sébastien Coron, David Naccache, Mehdi...
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
16 years 5 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
TASLP
2010
142views more  TASLP 2010»
14 years 11 months ago
Beyond the Narrowband Approximation: Wideband Convex Methods for Under-Determined Reverberant Audio Source Separation
We consider the problem of extracting the source signals from an under-determined convolutive mixture assuming known mixing filters. State-of-the-art methods operate in the time-fr...
M. Kowalski, Emmanuel Vincent, Rémi Gribonv...
SIAMIS
2010
114views more  SIAMIS 2010»
15 years 3 months ago
Improved Total Variation-Type Regularization Using Higher Order Edge Detectors
We present a novel deconvolution approach to accurately restore piecewise smooth signals from blurred data. The first stage uses Higher Order Total Variation restorations to obtai...
Wolfgang Stefan, Rosemary A. Renaut, Anne Gelb
159
Voted
ESANN
2001
15 years 6 months ago
Learning fault-tolerance in Radial Basis Function Networks
This paper describes a method of supervised learning based on forward selection branching. This method improves fault tolerance by means of combining information related to general...
Xavier Parra, Andreu Català