Sciweavers

1449 search results - page 98 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
ISMVL
1997
IEEE
82views Hardware» more  ISMVL 1997»
15 years 10 months ago
Finding Composition Trees for Multiple-Valued Functions
The composition tree of a given function, when it exists, provides a representation of the function revealing all possible disjunctive decompositions, thereby suggesting a realiza...
Elena Dubrova, Jon C. Muzio, Bernhard von Stengel
DAC
1996
ACM
15 years 10 months ago
Bit-Level Analysis of an SRT Divider Circuit
Abstract-- It is impractical to verify multiplier or divider circuits entirely at the bit-level using ordered Binary Decision Diagrams (BDDs), because the BDD representations for t...
Randal E. Bryant
ATAL
2009
Springer
15 years 10 months ago
Improved approximation of interactive dynamic influence diagrams using discriminative model updates
Interactive dynamic influence diagrams (I-DIDs) are graphical models for sequential decision making in uncertain settings shared by other agents. Algorithms for solving I-DIDs fac...
Prashant Doshi, Yifeng Zeng
ICADL
2007
Springer
127views Education» more  ICADL 2007»
15 years 10 months ago
Blog Classification Using Tags: An Empirical Study
With an exponential growth of Weblogs (or blogs), many blog directories have appeared to help users to locate topical blogs. As tags are commonly used to describe blogs, we study t...
Aixin Sun, Maggy Anastasia Suryanto, Ying Liu
AI
2006
Springer
15 years 10 months ago
Exploiting Dynamic Independence in a Static Conditioning Graph
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
Kevin Grant, Michael C. Horsch