Show simple item record

dc.contributor.advisorMitra, Debasis
dc.contributor.authorTandon, Gaurav
dc.contributor.authorMitra, Debasis
dc.date.accessioned2013-11-05T18:30:52Z
dc.date.available2013-11-05T18:30:52Z
dc.date.issued2003-04-01
dc.identifier.citationTandon, G., Mitra, D. (2003). A representation scheme for finite length strings (CS-2003-07). Melbourne, FL. Florida Institute of Technology.en_US
dc.identifier.otherCS-2003-07
dc.identifier.urihttp://hdl.handle.net/11141/115
dc.description.abstractThis study is an attempt to create a canonical representation scheme for finite length strings to simplify the study of the theory behind different classes of patterns and to ease the understanding of the underlying separability issues. This could then be used to determine what kinds of techniques are suitable for what class of separability (linear, multi-linear, or non-linear). This representation can then be used in intrusion detection, biological sequences, pattern recognition/classification and numerous other applications.en_US
dc.language.isoen_USen_US
dc.rightsCopyright held by authorsen_US
dc.titleA representation scheme for finite length stringsen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record