Sciweavers

1728 search results - page 239 / 346
» The Size of Power Automata
Sort
View
ALT
2009
Springer
16 years 3 months ago
Approximation Algorithms for Tensor Clustering
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
Stefanie Jegelka, Suvrit Sra, Arindam Banerjee
ICCD
2008
IEEE
124views Hardware» more  ICCD 2008»
16 years 3 months ago
Global bus route optimization with application to microarchitectural design exploration
— Circuit and processor designs will continue to increase in complexity for the foreseeable future. With these increasing sizes comes the use of wide buses to move large amounts ...
Dae Hyun Kim, Sung Kyu Lim
ICCD
2006
IEEE
95views Hardware» more  ICCD 2006»
16 years 3 months ago
Scale in Chip Interconnect requires Network Technology
— Continued scaling of CMOS has lead to a problem of scale as gates are faster than light travelling across a chip. Scalability used to be the hallmark of CMOS. Half the size, do...
Enno Wein
ICCD
2005
IEEE
119views Hardware» more  ICCD 2005»
16 years 3 months ago
Deployment of Better Than Worst-Case Design: Solutions and Needs
The advent of nanometer feature sizes in silicon fabrication has triggered a number of new design challenges for computer designers. These challenges include design complexity and...
Todd M. Austin, Valeria Bertacco
ICCAD
2007
IEEE
153views Hardware» more  ICCAD 2007»
16 years 3 months ago
Checking equivalence of quantum circuits and states
Among the post-CMOS technologies currently under investigation, quantum computing (QC) holds a special place. QC offers not only extremely small size and low power, but also expon...
George F. Viamontes, Igor L. Markov, John P. Hayes