Sciweavers

1159 search results - page 44 / 232
» Binary Decision Graphs
Sort
View
ICCD
2006
IEEE
125views Hardware» more  ICCD 2006»
14 years 6 months ago
Partial Functional Manipulation Based Wirelength Minimization
—In-place flipping of rectangular blocks/cells can potentially reduce the wirelength of a floorplan/placement solution without changing the chip area, In a recent work [Hao 05], ...
Avijit Dutta, David Z. Pan
MFCS
2007
Springer
14 years 3 months ago
Transition Graphs of Rewriting Systems over Unranked Trees
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
Christof Löding, Alex Spelten
ICASSP
2011
IEEE
13 years 23 days ago
Discriminant binary data representation for speaker recognition
In supervector UBM/GMM paradigm, each acoustic file is represented by the mean parameters of a GMM model. This supervector space is used as a data representation space, which has...
Jean-François Bonastre, Pierre-Michel Bousq...
ICRA
2006
IEEE
85views Robotics» more  ICRA 2006»
14 years 3 months ago
Design of Classifier to Automate the Evaluation of Protein Crystallization States
– This paper presents a method for designing classifier to automate an evaluation process of protein crystallization growth states. The classifier is designed by binary decision ...
Kanako Saitoh, Kuniaki Kawabata, Hajime Asama, Tak...
ISCAS
2003
IEEE
122views Hardware» more  ISCAS 2003»
14 years 2 months ago
Reducing the number of variable movements in exact BDD minimization
Ordered Binary Decision Diagrams (BDDs) are frequently used in logic synthesis. In this paper a new exact BDD minimization algorithm is presented, which is based on state space se...
Rüdiger Ebendt