An efficient approach for Interactive Sequential Pattern Recognition
详细信息    查看全文
文摘
Searching the optimal decoding for Interactive Sequential Pattern Recognition tasks may be computationally expensive. A normalization procedure is proposed so that computing optimal hypotheses becomes more efficient. A specially profitable case is reported when dealing with Regular Languages. Experimental results show a significant save of computational time.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700