Author:
Phoha Shashi,Virani Nurali,Chattopadhyay Pritthi,Sarkar Soumalya,Smith Brian,Ray Asok
Reference21 articles.
1. P. Adenis, K. Mukherjee, and A. Ray. State splitting and state merging in probabilistic finite state automata. Proc. American Control Conference, San Francisco, CA, USA, pages 5145-5150, 2011.
2. E.A. Akkoyunlu. The enumeration of maximal cliques of large graphs. SIAM Journal on Com- puting, 2:1-6, 1973.
3. E. Blasch, J. Herrero, L. Snidaro, J. Llinas, G. Seetharaman, and K. Palaniappan. Overview of contextual tracking approaches in information fusion. In Proceedings of SPIE, 2013.
4. C. Bron and J. Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Communca- tions of ACM, 16(9):575-577, 1973.
5. C. Burges. A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery, 2:121-167, 1998.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献