Sciweavers

66 search results - page 9 / 14
» Applying Graph Reduction Techniques for Identifying Structur...
Sort
View
NIPS
2008
13 years 9 months ago
Non-stationary dynamic Bayesian networks
Abstract: Structure learning of dynamic Bayesian networks provide a principled mechanism for identifying conditional dependencies in time-series data. This learning procedure assum...
Joshua W. Robinson, Alexander J. Hartemink
IPPS
2008
IEEE
14 years 1 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
BPM
2009
Springer
340views Business» more  BPM 2009»
14 years 2 months ago
Abstractions in Process Mining: A Taxonomy of Patterns
ions in Process Mining: A Taxonomy of Patterns R.P. Jagadeesh Chandra Bose1,2 and Wil M.P. van der Aalst1 1 Department of Mathematics and Computer Science, University of Technology...
R. P. Jagadeesh Chandra Bose, Wil M. P. van der Aa...
BIRTHDAY
2009
Springer
14 years 2 months ago
Hybrid BDD and All-SAT Method for Model Checking
We present a new hybrid BDD and SAT-based algorithm for model checking. Our algorithm is based on backward search, where each pre-image computation consists of an efficient All-SA...
Avi Yadgar, Orna Grumberg, Assaf Schuster
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
13 years 11 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...