Sciweavers

19320 search results - page 3738 / 3864
» On the complexity of computing determinants
Sort
View
VLSID
2007
IEEE
146views VLSI» more  VLSID 2007»
15 years 10 months ago
Architecting Microprocessor Components in 3D Design Space
Interconnect is one of the major concerns in current and future microprocessor designs from both performance and power consumption perspective. The emergence of three-dimensional ...
Balaji Vaidyanathan, Wei-Lun Hung, Feng Wang 0004,...
VLSID
2006
IEEE
150views VLSI» more  VLSID 2006»
15 years 10 months ago
A Comprehensive SoC Design Methodology for Nanometer Design Challenges
SoC design methodologies are under constant revision due to adoption of fast shrinking process technologies at nanometer levels. Nanometer process geometries exhibit new complex d...
R. Raghavendra Kumar, Ricky Bedi, Ramadas Rajagopa...
VLSID
2004
IEEE
170views VLSI» more  VLSID 2004»
15 years 10 months ago
On-chip networks: A scalable, communication-centric embedded system design paradigm
As chip complexity grows, design productivity boost is expected from reuse of large parts and blocks of previous designs with the design effort largely invested into the new parts...
Jörg Henkel, Srimat T. Chakradhar, Wayne Wolf
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
15 years 10 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
15 years 10 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
« Prev « First page 3738 / 3864 Last » Next »