2430 search results - page 160 / 486 » Computing Tutte Polynomials |
148
click to vote
DAC
1996
ACM
15 years 9 months ago
1996
ACM
Abstract A divide-and-conquer algorithm for computing the parametric yield of large analog circuits is presented. The algorithm targets applications whose performance spreads could...
125
click to vote
CISST
2003
15 years 6 months ago
2003
This paper addresses computational efficiency issues of a new algebraic method for imagery registration/conflation. An algebraic approach to conflation/registration of images does ...
137
click to vote
IJAR
2006
15 years 4 months ago
2006
In many real-life situations, we only have partial information about the actual probability distribution. For example, under Dempster-Shafer uncertainty, we only know the masses m...
142
click to vote
TC
2008
15 years 4 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
133
click to vote
AI
2002
Springer
15 years 4 months ago
2002
Springer
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...