<rdf:RDF xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="http://www.bibsonomy.org/user/tmalsburg/editdistance"><title>BibSonomy publications for /user/tmalsburg/editdistance</title><link>http://www.bibsonomy.org/user/tmalsburg/editdistance</link><description>BibSonomy RSS Feed for /user/tmalsburg/editdistance</description><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/230af7cf6b221e46de3f6f4eca27900aa/tmalsburg"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2668a64114d9dedf793cb2644e05dac14/tmalsburg"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f20e09e3ada7200aed0d7cfb87096940/tmalsburg"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/27647daf53f3c46bff7ab25d918717763/tmalsburg"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/230af7cf6b221e46de3f6f4eca27900aa/tmalsburg"><title>Visual attention to repeated internet images: testing the scanpath theory on the world wide web</title><link>http://www.bibsonomy.org/bibtex/230af7cf6b221e46de3f6f4eca27900aa/tmalsburg</link><dc:creator>tmalsburg</dc:creator><dc:date>2007-12-10T12:10:27+01:00</dc:date><dc:subject>attention vision editdistance perception scanpaths </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Sheree &lt;a href=&#034;http://www.bibsonomy.org/author/Josephson&#034;&gt;Josephson&lt;/a&gt;  und Michael E. &lt;a href=&#034;http://www.bibsonomy.org/author/Holmes&#034;&gt;Holmes&lt;/a&gt;  &lt;/span&gt;(&lt;em&gt;2002&lt;/em&gt;) &lt;a href=&#034;http://www.bibsonomy.org/bibtex/230af7cf6b221e46de3f6f4eca27900aa/tmalsburg&#034;&gt;&lt;i&gt;Visual attention to repeated internet images: testing the scanpath theory on the world wide web.&lt;/i&gt;&lt;/a&gt;&lt;em&gt;Proceedings of the symposium on Eye tracking research \&amp;amp; applications&lt;/em&gt;&lt;em&gt;Seite43--49. &lt;/em&gt;&lt;em&gt;ACM Press New York, NY, USA, &lt;/em&gt;
	     [&lt;a href=&#034;http://www.bibsonomy.org/&#034;&gt;BibSonomy&lt;/a&gt;:
             &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/attention&#034;&gt;attention&lt;/a&gt; &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/vision&#034;&gt;vision&lt;/a&gt; &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/editdistance&#034;&gt;editdistance&lt;/a&gt; &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/perception&#034;&gt;perception&lt;/a&gt; &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/scanpaths&#034;&gt;scanpaths&lt;/a&gt;]</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/attention"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/vision"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/editdistance"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/perception"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/scanpaths"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2668a64114d9dedf793cb2644e05dac14/tmalsburg"><title>A technique for computer detection and correction of spelling errors</title><description>A technique for computer detection and correction of spelling errors</description><link>http://www.bibsonomy.org/bibtex/2668a64114d9dedf793cb2644e05dac14/tmalsburg</link><dc:creator>tmalsburg</dc:creator><dc:date>2007-05-22T14:19:45+02:00</dc:date><dc:subject>B_scanpathsimilarity algorithm editdistance stringsimilarity informationtheory </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Fred J. &lt;a href=&#034;http://www.bibsonomy.org/author/Damerau&#034;&gt;Damerau&lt;/a&gt;  &lt;/span&gt;(&lt;em&gt;1964&lt;/em&gt;) &lt;a href=&#034;http://www.bibsonomy.org/bibtex/2668a64114d9dedf793cb2644e05dac14/tmalsburg&#034;&gt;&lt;i&gt;A technique for computer detection and correction of spelling errors.&lt;/i&gt;&lt;/a&gt;&lt;em&gt;Commun. ACM&lt;/em&gt;&lt;em&gt;Volume7. &lt;/em&gt;&lt;em&gt;Seite171--176. &lt;/em&gt;&lt;em&gt;New York, NY, USA, &lt;/em&gt;&lt;em&gt;ACM Press, &lt;/em&gt;
	     [&lt;a href=&#034;http://www.bibsonomy.org/&#034;&gt;BibSonomy&lt;/a&gt;:
             &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/B_scanpathsimilarity&#034;&gt;B_scanpathsimilarity&lt;/a&gt; &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/algorithm&#034;&gt;algorithm&lt;/a&gt; &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/editdistance&#034;&gt;editdistance&lt;/a&gt; &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/stringsimilarity&#034;&gt;stringsimilarity&lt;/a&gt; &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/informationtheory&#034;&gt;informationtheory&lt;/a&gt;]
	     &lt;a href=&#034;http://portal.acm.org/citation.cfm?id=363994&#034;&gt;URL&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/B_scanpathsimilarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/editdistance"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/stringsimilarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/informationtheory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2f20e09e3ada7200aed0d7cfb87096940/tmalsburg"><title>Exact indexing of dynamic time warping</title><description>Exact Indexing of Dynamic Time Warping - Keogh (ResearchIndex)</description><link>http://www.bibsonomy.org/bibtex/2f20e09e3ada7200aed0d7cfb87096940/tmalsburg</link><dc:creator>tmalsburg</dc:creator><dc:date>2007-02-17T12:59:51+01:00</dc:date><dc:subject>editdistance B_scanpathsimilarity timeseries dynamictimewarping distancemeasure </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Eamonn &lt;a href=&#034;http://www.bibsonomy.org/author/Keogh&#034;&gt;Keogh&lt;/a&gt;  &lt;/span&gt;(&lt;em&gt;2002&lt;/em&gt;) &lt;a href=&#034;http://www.bibsonomy.org/bibtex/2f20e09e3ada7200aed0d7cfb87096940/tmalsburg&#034;&gt;&lt;i&gt;Exact indexing of dynamic time warping.&lt;/i&gt;&lt;/a&gt;
	     [&lt;a href=&#034;http://www.bibsonomy.org/&#034;&gt;BibSonomy&lt;/a&gt;:
             &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/editdistance&#034;&gt;editdistance&lt;/a&gt; &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/B_scanpathsimilarity&#034;&gt;B_scanpathsimilarity&lt;/a&gt; &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/timeseries&#034;&gt;timeseries&lt;/a&gt; &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/dynamictimewarping&#034;&gt;dynamictimewarping&lt;/a&gt; &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/distancemeasure&#034;&gt;distancemeasure&lt;/a&gt;]
	     &lt;a href=&#034;citeseer.ist.psu.edu/article/keogh02exact.html&#034;&gt;URL&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/editdistance"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/B_scanpathsimilarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/timeseries"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dynamictimewarping"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/distancemeasure"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/27647daf53f3c46bff7ab25d918717763/tmalsburg"><title>A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances.</title><description>about Levenshtein and Damerau editdistanz from dblp</description><link>http://www.bibsonomy.org/bibtex/27647daf53f3c46bff7ab25d918717763/tmalsburg</link><dc:creator>tmalsburg</dc:creator><dc:date>2006-05-14T11:44:27+02:00</dc:date><dc:subject>article algorithm B_scanpathsimilarity editdistance toread stringsimilarity </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Heikki &lt;a href=&#034;http://www.bibsonomy.org/author/Hyyrö&#034;&gt;Hyyr&amp;#246;&lt;/a&gt;  &lt;/span&gt;(&lt;em&gt;2003&lt;/em&gt;) &lt;a href=&#034;http://www.bibsonomy.org/bibtex/27647daf53f3c46bff7ab25d918717763/tmalsburg&#034;&gt;&lt;i&gt;A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances..&lt;/i&gt;&lt;/a&gt;&lt;em&gt;Nord. J. Comput.&lt;/em&gt;&lt;em&gt;Volume10. &lt;/em&gt;&lt;em&gt;Seite29-39. &lt;/em&gt;
	     [&lt;a href=&#034;http://www.bibsonomy.org/&#034;&gt;BibSonomy&lt;/a&gt;:
             &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/article&#034;&gt;article&lt;/a&gt; &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/algorithm&#034;&gt;algorithm&lt;/a&gt; &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/B_scanpathsimilarity&#034;&gt;B_scanpathsimilarity&lt;/a&gt; &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/editdistance&#034;&gt;editdistance&lt;/a&gt; &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/toread&#034;&gt;toread&lt;/a&gt; &lt;a href=&#034;http://www.bibsonomy.org/user/tmalsburg/stringsimilarity&#034;&gt;stringsimilarity&lt;/a&gt;]
	     &lt;a href=&#034;http://dblp.uni-trier.de/db/journals/njc/njc10.html#Hyyro03&#034;&gt;URL&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/article"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/B_scanpathsimilarity"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/editdistance"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/toread"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/stringsimilarity"/></rdf:Bag></taxo:topics></item></rdf:RDF>