Sciweavers

246 search results - page 33 / 50
» Statistical gate sizing for timing yield optimization
Sort
View
CORR
2010
Springer
186views Education» more  CORR 2010»
13 years 7 months ago
Channel Estimation for Opportunistic Spectrum Access: Uniform and Random Sensing
The knowledge of channel statistics can be very helpful in making sound opportunistic spectrum access decisions. It is therefore desirable to be able to efficiently and accurately...
Quanquan Liang, Mingyan Liu
FOCS
2006
IEEE
14 years 1 months ago
Algebraic Structures and Algorithms for Matching and Matroid Problems
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
Nicholas J. A. Harvey
FPGA
2004
ACM
121views FPGA» more  FPGA 2004»
14 years 1 months ago
Divide and concatenate: a scalable hardware architecture for universal MAC
We present a cryptographic architecture optimization technique called divide-and-concatenate based on two observations: (i) the area of a multiplier and associated data path decre...
Bo Yang, Ramesh Karri, David A. McGrew
VLSID
2009
IEEE
155views VLSI» more  VLSID 2009»
14 years 8 months ago
Unified Challenges in Nano-CMOS High-Level Synthesis
: The challenges in nano-CMOS circuit design include the following: variability, leakage, power, thermals, reliability, and yield. This talk will focus on interdependent considerat...
Saraju P. Mohanty
FOCS
1999
IEEE
13 years 12 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson