Sciweavers

90 search results - page 3 / 18
» The Power of Depth 2 Circuits over Algebras
Sort
View
SPAA
2005
ACM
15 years 3 months ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams
80
Voted
CORR
2002
Springer
101views Education» more  CORR 2002»
14 years 9 months ago
Quantum Circuits with Unbounded Fan-out
We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denot...
Peter Høyer, Robert Spalek
ISQED
2007
IEEE
254views Hardware» more  ISQED 2007»
15 years 3 months ago
An Aggregation-Based Algebraic Multigrid Method for Power Grid Analysis
ct This paper develops an aggregation-based algebraic multigrid (AbAMG) method to efficiently analyze the power grids. Different from the conventional algebraic multigrid (AMG) sc...
Pei-Yu Huang, Huan-Yu Chou, Yu-Min Lee
BIRTHDAY
2003
Springer
15 years 2 months ago
Digital Algebra and Circuits
Abstract. Digital numbers D are the world’s most popular data representation: nearly all texts, sounds and images are coded somewhere in time and space by binary sequences. The m...
Jean Vuillemin
78
Voted
MICRO
2003
IEEE
124views Hardware» more  MICRO 2003»
15 years 2 months ago
Optimum Power/Performance Pipeline Depth
The impact of pipeline length on both the power and performance of a microprocessor is explored both theoretically and by simulation. A theory is presented for a wide range of pow...
Allan Hartstein, Thomas R. Puzak