( en | de | ru )

 

Disambiguation of "Studený, Milan"

Author of the publication

copydeleteadd this publication to your clipboard
Racing algorithms for conditional independence inference.

, and . Int. J. Approx. Reason., 45 (2): 386-401 (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Winfried Studeny

Anton Studeny

Doris Studeny

Wilfried Studeny

Gisela Studeny

 

Other publications of authors with the same name

The Chordal Graph Polytope for Learning Decomposable Models., and . Probabilistic Graphical Models, volume 52 of JMLR Workshop and Conference Proceedings, page 499-510. JMLR.org, (2016)Bayesian Networks from the Point of View of Chain Graphs.. UAI, page 496-503. Morgan Kaufmann, (1998)Characterization of Inclusion Neighbourhood in Terms of the Essential Graph: Uper Neighbours.. ECSQARU, volume 2711 of Lecture Notes in Computer Science, page 161-172. Springer, (2003)Marginal Problem in Different Calculi of AI.. IPMU, volume 945 of Lecture Notes in Computer Science, page 348-359. Springer, (1994)Linear criterion for testing the extremity of an exact game based on its finest min-representation., and . Int. J. Approx. Reason., (2018)How matroids occur in the context of learning Bayesian network structure.. UAI, page 832-841. AUAI Press, (2015)On Separation Criterion and Recovery Algorithm for Chain Graphs. CoRR, (2013)Learning Bayesian network structure: Towards the essential graph by integer linear programming tools., and . Int. J. Approx. Reason., 55 (4): 1043-1071 (2014)A graphical characterization of the largest chain graphs., and . Int. J. Approx. Reason., 20 (3): 209-236 (1999)A reconstruction algorithm for the essential graph., and . Int. J. Approx. Reason., 50 (2): 385-413 (2009)