Sciweavers

5363 search results - page 22 / 1073
» Building the Cerebellum in a Computer
Sort
View
ACSE
1998
ACM
13 years 11 months ago
Building a rigorous research agenda into changes to teaching
: Building research into teaching has particular value in the current academic climate; this paper considers why and reflects on the particular need for Computer Science education ...
Mats Daniels, Marian Petre, Anders Berglund
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
12 years 7 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
TCC
2012
Springer
245views Cryptology» more  TCC 2012»
12 years 2 months ago
Secure Two-Party Computation with Low Communication
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...
Ivan Damgård, Sebastian Faust, Carmit Hazay
PAMI
2012
11 years 9 months ago
BRIEF: Computing a Local Binary Descriptor Very Fast
Binary descriptors are becoming increasingly popular as a means to compare feature points very fast and while requiring comparatively small amounts of memory. The typical approach...
Michael Calonder, Vincent Lepetit, Mustafa Öz...
IPPS
1998
IEEE
13 years 11 months ago
Building BSP Programs Using the Refinement Calculus
Abstract. We extend the refinement calculus to permit the derivation of programs in the Bulk Synchronous Parallelism (BSP) style. This demonstrates that formal approaches developed...
David B. Skillicorn