An efficient algorithm for the $N$-best-strings problem

Mehryar Mohri and Michael Riley
Proc. Int. Conf. Spoken Language Processing (ICSLP 2002), 2002
http://www.research.att.com/~mohri/postscript/nbest.ps

Cites:

[D. Eppstein publications] [Citation database] [Documents]
Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!