Sciweavers

12194 search results - page 347 / 2439
» Numberings Optimal for Learning
Sort
View
WDAG
2007
Springer
100views Algorithms» more  WDAG 2007»
16 years 25 days ago
Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions
We present the first optimally resilient, bounded, wait-free implementation of a distributed atomic register, tolerating Byzantine readers and (up to one-third of) Byzantine serve...
Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi
ASAP
2006
IEEE
106views Hardware» more  ASAP 2006»
16 years 23 days ago
Throughput Optimized SHA-1 Architecture Using Unfolding Transformation
In this paper, we analyze the theoretical delay bound of the SHA-1 algorithm and propose architectures to achieve high throughput hardware implementations which approach this boun...
Yong Ki Lee, Herwin Chan, Ingrid Verbauwhede
153
Voted
PDP
2006
IEEE
16 years 22 days ago
Probabilistic and Dynamic Optimization of Job Partitioning on a Grid Infrastructure
Production grids have a potential for parallel execution of a very large number of tasks but also introduce a high overhead that significantly impacts the execution of short task...
Tristan Glatard, Johan Montagnat, Xavier Pennec
PATMOS
2004
Springer
16 years 2 days ago
Optimal Logarithmic Representation in Terms of SNR Behavior
This paper investigates the Signal-to-Noise Ratio (SNR) performance of the Logarithmic Number System (LNS) representation against the SNR performance of the fixed-point representa...
Panagiotis D. Vouzis, Vassilis Paliouras
CC
2003
Springer
126views System Software» more  CC 2003»
15 years 12 months ago
Offset Assignment Showdown: Evaluation of DSP Address Code Optimization Algorithms
Abstract. Offset assignment is a highly effective DSP address code optimization technique that has been implemented in a number of ANSI C compilers. In this paper we concentrate on...
Rainer Leupers