Sciweavers

193 search results - page 27 / 39
» Short Bases of Lattices over Number Fields
Sort
View
TIT
2008
164views more  TIT 2008»
13 years 8 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
VLSISP
2010
205views more  VLSISP 2010»
13 years 6 months ago
Adaptable, Fast, Area-Efficient Architecture for Logarithm Approximation with Arbitrary Accuracy on FPGA
— This paper presents ALA (Adaptable Logarithm Approximation), a novel hardware architecture for the approximation of the base-2 logarithm of integers at an arbitrary accuracy, s...
Dimitris G. Bariamis, Dimitris Maroulis, Dimitrios...
ICCAD
2005
IEEE
94views Hardware» more  ICCAD 2005»
14 years 5 months ago
Post-placement voltage island generation under performance requirement
High power consumption not only leads to short battery life for handheld devices, but also causes on-chip thermal and reliability problems in general. As power consumption is prop...
Huaizhi Wu, I-Min Liu, Martin D. F. Wong, Yusu Wan...
CVPR
2010
IEEE
14 years 4 months ago
Monocular 3D Pose Estimation and Tracking by Detection
Automatic recovery of 3D human pose from monocular image sequences is a challenging and important research topic with numerous applications. Although current methods are able to r...
Mykhaylo Andriluka, Stefan Roth, Bernt Schiele
ICC
2008
IEEE
116views Communications» more  ICC 2008»
14 years 2 months ago
Pre-Equalization for Pre-Rake MISO DS-UWB Systems
—In this paper, we propose two novel pre–equalization schemes for multiple–input single–output (MISO) direct–sequence ultra–wideband (DS–UWB) systems with pre–Rake ...
Elham Torabi, Jan Mietzner, Robert Schober