Sciweavers

4123 search results - page 822 / 825
» Multiple Relational Embedding
Sort
View
COMPSAC
2011
IEEE
12 years 7 months ago
Palimpsests of Time and Place
— This paper discusses ongoing research into the development of an original composition portfolio themed on the concept of palimpsests of time and place. The research involves th...
Jerry Fishenden, Andrew Hugill
IACR
2011
106views more  IACR 2011»
12 years 7 months ago
Hash Functions Based on Three Permutations: A Generic Security Analysis
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
Bart Mennink, Bart Preneel
IACR
2011
128views more  IACR 2011»
12 years 7 months ago
Sign Modules in Secure Arithmetic Circuits
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
Ching-Hua Yu
CORR
2012
Springer
194views Education» more  CORR 2012»
12 years 3 months ago
A Graph Theoretical Approach to Network Encoding Complexity
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....
Li Xu, Weiping Shang, Guangyue Han
HPCA
2012
IEEE
12 years 2 months ago
Improving write operations in MLC phase change memory
Phase change memory (PCM) recently has emerged as a promising technology to meet the fast growing demand for large capacity memory in modern computer systems. In particular, multi...
Lei Jiang, Bo Zhao, Youtao Zhang, Jun Yang 0002, B...