摘要：
松弛技术：RELAX(u,v,w) if(d[v]>d[u]+w(u,v)){ d[v]=d[u]+w(u,v); p[v]=u;}松弛是改变最短路径和前趋的唯一方式。算法之间的区别在于对每条边进行松弛的次数，以及对边执行松弛操作的次序有所不同。Bellman–Ford is in its basic structure very similar toDijkstra's algorithm, but instead ofgreedilyselecting the minimum-weight node not yet processed to relax, it simply 阅读全文
摘要：
基本模型:HMM(Hidden Markov Models): A Tutorial on Hidden Markov Models and Selected Applications inSpeech Recognition.pdfME(Maximum Entropy): ME_to_NLP.pdfMEMM(Maximum Entropy Markov Models): memm.pdfCRF(Conditional Random Fields): An Introduction to Conditional Random Fields for Relational Lear... 阅读全文