Sciweavers

2520 search results - page 406 / 504
» The complexity of approximating entropy
Sort
View
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
15 years 9 months ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...
166
Voted
FOCS
2002
IEEE
15 years 9 months ago
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
Andrej Bogdanov, Kenji Obata, Luca Trevisan
GLVLSI
2002
IEEE
106views VLSI» more  GLVLSI 2002»
15 years 9 months ago
A low power direct digital frequency synthesizer with 60 dBc spectral purity
We present a low-power sine-output Direct Digital Frequency Synthesizer (DDFS) realized in 0.18 µm CMOS that achieves 60 dBc spectral purity from DC to the Nyquist frequency. No ...
J. M. Pierre Langlois, Dhamin Al-Khalili
ICPP
2002
IEEE
15 years 9 months ago
Optimal Video Replication and Placement on a Cluster of Video-on-Demand Servers
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
Xiaobo Zhou, Cheng-Zhong Xu
IPPS
2002
IEEE
15 years 9 months ago
Fast Inductance Extraction of Large VLSI Circuits
Accurate estimation of signal delay is critical to the design and verification of VLSI circuits. At very high frequencies, signal delay in circuits with small feature sizes is do...
Hemant Mahawar, Vivek Sarin, Weiping Shi