Sciweavers

6111 search results - page 214 / 1223
» Time, Hardware, and Uniformity
Sort
View
RV
2010
Springer
153views Hardware» more  RV 2010»
14 years 10 months ago
Run-Time Verification of Networked Software
Most applications that are in use today inter-operate with other applications, so-called peers, over a network. The analysis of such distributed applications requires that the effe...
Cyrille Valentin Artho
ASPDAC
2007
ACM
105views Hardware» more  ASPDAC 2007»
15 years 4 months ago
An Efficient Computation of Statistically Critical Sequential Paths Under Retiming
Abstract-- In this paper we present the Statistical Retimingbased Timing Analysis (SRTA) algorithm. The goal is to compute the timing slack distribution for the nodes in the timing...
Mongkol Ekpanyapong, Xin Zhao, Sung Kyu Lim
92
Voted
ASPDAC
2000
ACM
133views Hardware» more  ASPDAC 2000»
15 years 4 months ago
A VLSI implementation of the blowfish encryption/decryption algorithm
We propose an efficient hardware architecture for the Blowfish algorithm [1]. The speed is up to 4 bit/clock, which is 9 times faster than a Pentium. By applying operator-reschedul...
Michael C.-J. Lin, Youn-Long Lin
ICDE
2005
IEEE
106views Database» more  ICDE 2005»
16 years 2 months ago
Effective Computation of Biased Quantiles over Data Streams
Skewis prevalentin manydata sourcessuchas IP traffic streams. To continually summarize the distribution of such data, a highbiased set of quantiles (e.g., 50th, 90th and 99th perc...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
89
Voted
SPAA
2004
ACM
15 years 6 months ago
The effect of faults on network expansion
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary...