11 search results - page 2 / 3 » Optimal Size Integer Division Circuits |
SODA
2012
ACM
11 years 7 months ago
2012
ACM
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...
DAC
2006
ACM
14 years 6 months ago
2006
ACM
In a placed circuit, there are a lot of movable cells that can be flipped to further reduce the total wirelength, without affecting the original placement solution. We aim at solv...
ATS
2005
IEEE
13 years 7 months ago
2005
IEEE
Reversibility is of interest in achieving extremely low power dissipation; it is also an inherent design requirement of quantum computation. Logical fault models for conventional ...
TON
2010
13 years 3 months ago
2010
—The concept of p-cycle (preconfigured protection cycle) allows fast and efficient span protection in wavelength division multiplexing (WDM) mesh networks. To design p-cycles f...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...