Sciweavers

10054 search results - page 360 / 2011
» On the Complexity of Function Learning
Sort
View
DAC
2004
ACM
16 years 5 months ago
Reliability-driven layout decompaction for electromigration failure avoidance in complex mixed-signal IC designs
The negative effect of electromigration on signal and power line lifetime and functional reliability is an increasingly important problem for the physical design of integrated cir...
Goeran Jerke, Jürgen Scheible, Jens Lienig
ICCD
2003
IEEE
111views Hardware» more  ICCD 2003»
16 years 1 months ago
Reducing Operand Transport Complexity of Superscalar Processors using Distributed Register Files
A critical problem in wide-issue superscalar processors is the limit on cycle time imposed by the central register file and operand bypass network. In this paper, a distributed re...
Santithorn Bunchua, D. Scott Wills, Linda M. Wills
VTC
2007
IEEE
15 years 10 months ago
Energy-Optimized Low-Complexity Control of Power and Rate in Clustered CDMA Sensor Networks with Multirate Constraints
—In this paper, we propose a low-complexity scheme for minimizing energy consumption in a clustered multirate CDMA sensor network with multiple receive antennas by jointly contro...
Chun-Hung Liu
ASPDAC
2004
ACM
97views Hardware» more  ASPDAC 2004»
15 years 9 months ago
Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost
As gate delays decrease faster than wire delays for each technology generation, buffer insertion becomes a popular method to reduce the interconnect delay. Several modern buffer in...
Weiping Shi, Zhuo Li, Charles J. Alpert
132
Voted
ICALP
2003
Springer
15 years 9 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen