Sciweavers

65 search results - page 7 / 13
» An adaptive software library for fast Fourier transforms
Sort
View
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
12 years 8 months ago
Fast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
Payman Mohassel
ICASSP
2008
IEEE
14 years 2 months ago
Identification of linear systems with adaptive control of the cross-multiplicative transfer function approximation
In this paper, we extend the cross-multiplicative transfer function (CMTF) approach for improved system identification in the shorttime Fourier transform (STFT) domain. The propo...
Yekutiel Avargel, Israel Cohen
FSE
2008
Springer
91views Cryptology» more  FSE 2008»
13 years 9 months ago
SWIFFT: A Modest Proposal for FFT Hashing
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
Vadim Lyubashevsky, Daniele Micciancio, Chris Peik...
BMCBI
2006
146views more  BMCBI 2006»
13 years 8 months ago
A database application for pre-processing, storage and comparison of mass spectra derived from patients and controls
Background: Statistical comparison of peptide profiles in biomarker discovery requires fast, userfriendly software for high throughput data analysis. Important features are flexib...
Mark K. Titulaer, Ivar Siccama, Lennard J. Dekker,...
ECOOP
2007
Springer
14 years 2 months ago
Metamodel Adaptation and Model Co-adaptation
Like other software artefacts, metamodels evolve over time. We propose a transformational approach to assist metamodel evolution by stepwise adaptation. In the first part of the p...
Guido Wachsmuth