Login / Signup
Reduction of Average Path Length in Binary Decision Diagrams by Spectral Methods.
Osnat Keren
Published in:
IEEE Trans. Computers (2008)
Keyphrases
</>
path length
spectral methods
binary decision diagrams
spectral analysis
shortest path
random walk
boolean functions
small world
spectral clustering
data mining applications
manifold learning
graph partitioning
machine learning
eigendecomposition
reinforcement learning
graph structures