Sciweavers

1477 search results - page 184 / 296
» Complexity of (iterated) dominance
Sort
View
122
Voted
EMMCVPR
1999
Springer
15 years 5 months ago
Auxiliary Variables for Markov Random Fields with Higher Order Interactions
Markov Random Fields are widely used in many image processing applications. Recently the shortcomings of some of the simpler forms of these models have become apparent, and models ...
Robin D. Morris
VLSID
1999
IEEE
100views VLSI» more  VLSID 1999»
15 years 5 months ago
Improved Effective Capacitance Computations for Use in Logic and Layout Optimization
We describe an improved iterationless approach for computing the effective capacitance of an interconnect load at a driving gate output. The speed and accuracy of our approach mak...
Andrew B. Kahng, Sudhakar Muddu
95
Voted
ICCAD
1998
IEEE
98views Hardware» more  ICCAD 1998»
15 years 5 months ago
Determination of worst-case aggressor alignment for delay calculation
Increases in delay due to coupling can have a dramatic impact on IC performance for deep submicron technologies. To achieve maximum performance there is a need for analyzing logic...
Paul D. Gross, Ravishankar Arunachalam, Karthik Ra...
73
Voted
ISLPED
1998
ACM
78views Hardware» more  ISLPED 1998»
15 years 5 months ago
Power-delay tradeoffs for radix-4 and radix-8 dividers
The use of higher radices in division reduces the number of iterations to complete the operation, but increases the complexity of the circuit. In this paper we explore the in uenc...
Alberto Nannarelli, Tomás Lang
CAV
1998
Springer
108views Hardware» more  CAV 1998»
15 years 5 months ago
Decomposing the Proof of Correctness of pipelined Microprocessors
We present a systematic approach to decompose and incrementally build the proof of correctness of pipelined microprocessors. The central idea is to construct the abstraction funct...
Ravi Hosabettu, Mandayam K. Srivas, Ganesh Gopalak...