Show simple item record

dc.contributor.authorMyers, Joseph Kenneth
dc.contributor.authorIsakov, Victor, 1947-
dc.contributor.authorChopra, Dharam
dc.date.accessioned2012-12-10T14:47:42Z
dc.date.available2012-12-10T14:47:42Z
dc.date.issued2007-03-12
dc.identifier.urihttp://hdl.handle.net/10057/5447
dc.descriptionThe project completed at the Wichita State University Department of Mathematics and Statistics. Presented at the 4th Annual Capitol Graduate Research Summit, Topeka, KS, 2007en_US
dc.description.abstractWe present a paper, computer programs, and source code which enable fast recognition of a finite set of language tokens. The recognition algorithm can write the source code for a computer program which provides a recognition function for any list of keywords. The resulting input recognition time is minimized and results in a 20% improvement for HTTP transmission speed, and much higher improvement for markup language parsing such as XML and HTML. The recognition system is also applied to determination of Multipart Internet Mail Extension registered file types, to spam filtering, and web-based email applications.en_US
dc.language.isoen_USen_US
dc.titleFast Language Token Recognition Algorithm applied to increase performance of Internet HTTP Web Serversen_US
dc.typeAbstract


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record