On Probabilistic Networks for Selection, Merging, and Sorting

Author： Leighton T.   Ma Y.   Suel T.  

Publisher： Springer Publishing Company

ISSN： 1432-4350

Source： Theory of Computing Systems, Vol.30, Iss.6, 1997-12, pp. : 559-582

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

On Construction of Sparse Probabilistic Boolean Networks

By  

East Asian Journal on Applied Mathematics, Vol. 2, Iss. 1, 2012-02 ,pp. : 1-18

Cambridge University Press

Access to resources Recommend Favorite

Modeling Probabilistic Networks of Discrete and Continuous Variables

By Castillo E.   Gutierrez J.M.   Hadi A.S.  

Journal of Multivariate Analysis, Vol. 64, Iss. 1, 1998-01 ,pp. : 48-65

Academic Press

Access to resources Recommend Favorite

Construction of Probabilistic Boolean Networks from a Prescribed Transition Probability Matrix: A Maximum Entropy Rate Approach

By  

East Asian Journal on Applied Mathematics, Vol. 1, Iss. 2, 2011-05 ,pp. : 132-154

Cambridge University Press

Access to resources Recommend Favorite

On Generating Optimal Sparse Probabilistic Boolean Networks with Maximum Entropy from a Positive Stationary Distribution

By  

East Asian Journal on Applied Mathematics, Vol. 2, Iss. 4, 2012-11 ,pp. : 353-372

Cambridge University Press

Access to resources Recommend Favorite

Breaking and merging of liquid sheets and filaments

By Keller J.B.   Milewski P.A.   Vanden-Broeck J-M.  

Journal of Engineering Mathematics, Vol. 42, Iss. 3-4, 2002-04 ,pp. : 283-290

Springer Publishing Company

Access to resources Recommend Favorite