Symbolic stochastic systems

Proceedings of the International Conference on Modeling, Simulation and Visualization Methods, MSV'04 and Proceedings of the Int. Conference on Algorithmic Mathematics and Comput. Sci., AMCS'04

Volumn , Issue , 2004, Pages 321-326

  Jeev, Kumar ^a   Lassez, Jean Louis ^a  

^a Department of Public Health   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTERIZATION; CODES (SYMBOLS); CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; MATRIX ALGEBRA; PROBABILITY; REDUNDANCY; THEOREM PROVING; TREES (MATHEMATICS);

COMPUTING COMPLEXITY; GAUSSIAN ELIMINATION METHOD; MARKOV GRAPH; TARSKI ELIMINATION;

MARKOV PROCESSES;

EID: 12344321082     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Anantharam V., Tsoucas P., A Proof of the Markov Chain Tree Theorem, Technical Report 1988-97, The Institute of Systems Research, Univesity of Maryland, Maryland, 1988.
2. Biggs N., Algebraic Graph Theory, Cambridge University Press, Cambridge UK, 2nd edition, 1994.
3. Bondy J. A., Murty U. S. R., Graph Theory with Applications, North-Holland, New York, 1976.
4. Chandru V., Lassez J.-L., Qualitative Theorem Proving, International Symposium on Verification: Theory and Practice, Taormina, July 2003, Springer Verlag Lecture Notes in Computer Science.
5. Even S., Graph Algorithms, Computer Science Press, Maryland, 1979.
6. Golumbic M., Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1980.
7. Karger D., Lecture Notes, 6.856J/18.416J Randomized Algorithms, MIT, 2002.
8. Kirchhoff G., Über die Auflösung der Gleichungen, auf welche man bei der untersuchung der linearen Verteilung galvanischer Ströme geführt wird, Ann. Phys. Chem. 72, 497-508, 1847.
9. Leighton F. T., Rivest R.L., The Markov chain tree theorem, Technical Report MIT/LCS/TM-249, Laboratory for Computer Science. MIT, Cambridge, Massachusetts, 1983.
10. Leighton F. T., Rivest R.L., Estimating a probability using finite memory, IEEE Transactions on Information Theory, v.32 n.6, p.733-742, 1986.
11. Lukashin A. V., Borodovsky M., GeneMark HMM: New Solutions to Gene Finding, Nucleic Acid Research, 1998 Feb 15 26(4) 1107-1115.
12. Maplesoft, Maple 9 Student Edition, Waterloo Maple Inc., 2003.
13. Meyn S. P., Tweedie, R. L., Markov Chains and Stochastic Stability, Springer-Verlag, London, 1993.
14. Moon J. W., Counting Labelled Trees, Canadian Mathematical Monographs, No.1, Canadian Mathematical Congress, 1970.
15. Motwani R., Raghavan P., Randomized Algorithms, Cambridge University Press, 1995.
16. Polya G., Aufgabe 424, Arch. Math. Phys., 20: 271, 1913.
17. Rabiner L. R., A tutorial on Hidden Markov Models, Proceedings of the IEEE, vol. 77, 257-286, 1989.
18. Robertson N., Seymour P. D., Thomas R., Permanents, Pfaffian orientations, and even directed circuits, Annals of Mathematics, 150, 929-975, 1999.
19. Valiant L. G., The complexity of computing the permanent, Theoretical Computer Science 8 (1979), 189-201, 1979. V. V.
20. Vazirani V. V., Yannakakis M., Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs, Discrete Appl. Math. 25, 179-190, 1989.
21. Zanko V, P-Completeness via Many-One Reductions, International Journal of Foundations of Computer Science (LJFCS) Volume 2, Number 1, 77, March, 1991.