Sciweavers

4212 search results - page 300 / 843
» On Compressible Pairings and Their Computation
Sort
View
TIT
2010
130views Education» more  TIT 2010»
15 years 1 months ago
Pseudo-random functions and parallelizable modes of operations of a block cipher
This paper considers the construction and analysis of pseudo-random functions (PRFs) with specific reference to modes of operations of a block cipher. In the context of message aut...
Palash Sarkar
HIPEAC
2011
Springer
14 years 6 months ago
Decoupled zero-compressed memory
For each computer system generation, there are always applications or workloads for which the main memory size is the major limitation. On the other hand, in many cases, one could...
Julien Dusser, André Seznec
ICPR
2006
IEEE
16 years 7 months ago
Patterns of Co-Linear Equidistant Letter Sequences and Verses
It has been shown ([4], [3]) that equidistant letter sequence (ELS) pairs in the book of Genesis (G) form more compact geometric patterns on the surface of a cylinder than is expe...
Nachum Bombach, Harold Gans
CHI
2002
ACM
16 years 7 months ago
AR Pad: an interface for face-to-face AR collaboration
The AR Pad is a handheld display with a Spaceball and a camera, which can be used to view and interact with Augmented Reality models in collaborative setting. Keywords Augmented R...
D. Mogilev, Kiyoshi Kiyokawa, Mark Billinghurst, J...
IWPEC
2009
Springer
16 years 1 months ago
An Exponential Time 2-Approximation Algorithm for Bandwidth
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...
Martin Fürer, Serge Gaspers, Shiva Prasad Kas...