Sciweavers

1670 search results - page 2 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
HPCN
1997
Springer
13 years 12 months ago
Boolean Function Manipulation on a Parallel System Using BDDs
This paper describes a distributed algorithm for Boolean function manipulation. The algorithm is based on Binary Decision Diagrams (BDDs), which are one of the most commonly used ...
F. Bianchi, Fulvio Corno, Maurizio Rebaudengo, Mat...
VALUETOOLS
2006
ACM
164views Hardware» more  VALUETOOLS 2006»
14 years 2 months ago
Analysis of Markov reward models using zero-suppressed multi-terminal BDDs
High-level stochastic description methods such as stochastic Petri nets, stochastic UML statecharts etc., together with specifications of performance variables (PVs), enable a co...
Kai Lampka, Markus Siegle
TOG
2008
102views more  TOG 2008»
13 years 8 months ago
Real-time data driven deformation using kernel canonical correlation analysis
Achieving intuitive control of animated surface deformation while observing a specific style is an important but challenging task in computer graphics. Solutions to this task can ...
Wei-Wen Feng, Byung-Uck Kim, Yizhou Yu
DAC
1994
ACM
13 years 12 months ago
New Techniques for Efficient Verification with Implicitly Conjoined BDDs
-- In previous work, Hu and Dill identified a common cause of BDD-size blowup in high-level design verification and proposed the method of implicitly conjoined invariants to addres...
Alan J. Hu, Gary York, David L. Dill
CPAIOR
2007
Springer
14 years 2 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker