Sciweavers

129 search results - page 10 / 26
» Discrete Fourier Transform Computation Using Neural Networks
Sort
View
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
13 years 9 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
SIGMOD
2010
ACM
236views Database» more  SIGMOD 2010»
15 years 2 months ago
Differentially private aggregation of distributed time-series with transformation and encryption
We propose PASTE, the first differentially private aggregation algorithms for distributed time-series data that offer good practical utility without any trusted server. PASTE add...
Vibhor Rastogi, Suman Nath
ICIP
1998
IEEE
15 years 11 months ago
An Explicit Closed-Form Solution to the Limited-Angle Discrete Tomography Problem for Finite-Support Objects
: An explicit formula is presented for reconstructing a This article derives an explicit formula for the integer values finite-support object defined on a lattice of points and tak...
Andrew E. Yagle
CORR
2002
Springer
123views Education» more  CORR 2002»
14 years 9 months ago
Ideal decompositions and computation of tensor normal forms
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...
Bernd Fiedler
ICML
1997
IEEE
15 years 10 months ago
Predicting Multiprocessor Memory Access Patterns with Learning Models
Machine learning techniques are applicable to computer system optimization. We show that shared memory multiprocessors can successfully utilize machine learning algorithms for mem...
M. F. Sakr, Steven P. Levitan, Donald M. Chiarulli...