![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Mukund Narasimhan Percy Liang , Mukund Narasimhan, Michael Shilman , Paul A. Viola : Efficient Geometric Algorithms for Parsing in Two Dimensions. ICDAR 2005 : 1172-1177 Mukund Narasimhan, Nebojsa Jojic , Jeff Bilmes : Q-Clustering. NIPS 2005 Paul A. Viola , Mukund Narasimhan: Learning to extract information from semi-structured text using a discriminative context free grammar. SIGIR 2005 : 330-337 Mukund Narasimhan, Jeff A. Bilmes : Optimal sub-graphical models. NIPS 2004 1 [ 1 ] [ 3 ] 2 [ 3 ] 3 [ 4 ] 4 [ 4 ] 5 [ 2 ] [ 4 ] ![]() ©2006 Association for Computing Machinery |