Sciweavers

523 search results - page 48 / 105
» On the Signal Bounding Problem in Timing Analysis
Sort
View
DAC
1995
ACM
15 years 8 months ago
Performance Analysis of Embedded Software Using Implicit Path Enumeration
—Embedded computer systems are characterized by the presence of a processor running application-specific dedicated software. A large number of these systems must satisfy real-ti...
Yau-Tsun Steven Li, Sharad Malik
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
16 years 6 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
16 years 5 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
FPGA
2007
ACM
142views FPGA» more  FPGA 2007»
15 years 11 months ago
Parametric yield in FPGAs due to within-die delay variations: a quantitative analysis
Variations in the semiconductor fabrication process results in variability in parameters between transistors on the same die, a problem exacerbated by lithographic scaling. The re...
N. Pete Sedcole, Peter Y. K. Cheung
INFOCOM
2002
IEEE
15 years 9 months ago
Performance Analysis of Deflection Routing in Optical Burst-Switched Networks
This paper concerns itself with the performance of deflection routing in optical burst-switched networks based on Just-Enough-Time (JET) signaling. Generally speaking, buffer requi...
Ching-Fang Hsu, Te-Lung Liu, Nen-Fu Huang