Sciweavers

523 search results - page 27 / 105
» codes 2011
Sort
View
175
Voted
NN
2011
Springer
348views Neural Networks» more  NN 2011»
14 years 4 months ago
Tree-like hierarchical associative memory structures
In this letter we explore an alternative structural representation for Steinbuch-type binary associative memories. These networks offer very generous storage capacities (both asy...
João Sacramento, Andreas Wichert
CACM
2011
96views more  CACM 2011»
14 years 4 months ago
Why STM can be more than a research toy
Software Transactional Memory (STM) promises to simplify concurrent programming without requiring specific hardware support. Yet, STM’s credibility lies on the extent to which ...
Aleksandar Dragojevic, Pascal Felber, Vincent Gram...
86
Voted
CORR
2011
Springer
178views Education» more  CORR 2011»
14 years 4 months ago
Anytime Reliable Codes for Stabilizing Plants over Erasure Channels
—The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in problems of distributed control and networked contro...
Ravi Teja Sukhavasi, Babak Hassibi
94
Voted
IACR
2011
125views more  IACR 2011»
13 years 9 months ago
On Constructing Homomorphic Encryption Schemes from Coding Theory
Abstract. Homomorphic encryption schemes are powerful cryptographic primitives that allow for a variety of applications. Consequently, a variety of proposals have been made in the ...
Frederik Armknecht, Daniel Augot, Ludovic Perret, ...
CGO
2011
IEEE
14 years 1 months ago
Flow-sensitive pointer analysis for millions of lines of code
—Many program analyses benefit, both in precision and performance, from precise pointer analysis. An important dimension of pointer analysis precision is flow-sensitivity, whic...
Ben Hardekopf, Calvin Lin