Sciweavers

3608 search results - page 135 / 722
» computer 2011
Sort
View
145
Voted
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
14 years 3 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
140
Voted
CORR
2011
Springer
144views Education» more  CORR 2011»
14 years 10 months ago
On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function
— Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we ...
Mehdi Molkaraie, Payam Pakzad
ICASSP
2011
IEEE
14 years 7 months ago
In-class demonstrations with a portable laboratory for teaching DSP to Computer Engineering majors
Given its pervasive use, and being a clear example of a computing system integrating hardware and software, Digital Signal Processing (DSP) is an important discipline in Computer ...
Andres Kwasinski
ICASSP
2011
IEEE
14 years 7 months ago
Efficiently computing private recommendations
Online recommender systems enable personalized service to users. The underlying collaborative filtering techniques operate on privacy sensitive user data, which could be misused ...
Zekeriya Erkin, M. Beye, T. Veugen, Reginald L. La...
152
Voted
AGI
2011
14 years 7 months ago
What Makes a Brain Smart? Reservoir Computing as an Approach for General Intelligence
Abstract. Recurrent connectivity, balanced between excitation and inhibition, is a general principle of cortical connectivity. We propose that balanced recurrence can be achieved b...
Janelle Szary, Bryan Kerster, Christopher T. Kello