<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/user/armin_/algorithms"><title>BibSonomy bookmarks for /user/armin_/algorithms</title><link>https://www.bibsonomy.org/user/armin_/algorithms</link><description>BibSonomy RSS Feed for /user/armin_/algorithms</description><items><rdf:Seq><rdf:li rdf:resource="http://www.nist.gov/dads/"/><rdf:li rdf:resource="http://www.cs.cmu.edu/~anind/"/><rdf:li rdf:resource="http://www.it.usyd.edu.au/~judy/Homec/personalisation.html"/><rdf:li rdf:resource="http://www.is.informatik.uni-duisburg.de/wiki/index.php/ASDL:User_Modelling"/><rdf:li rdf:resource="http://scholar.google.at/scholar?q=nearest+neighbor&amp;hl=de&amp;lr=&amp;scoring=r&amp;as_ylo=2001"/><rdf:li rdf:resource="http://www.statistical-pattern-recognition.net/"/><rdf:li rdf:resource="http://en.wikipedia.org/wiki/Similarity_matrix"/><rdf:li rdf:resource="http://www.voronoi.com/"/><rdf:li rdf:resource="http://coe.sdsu.edu/eet/Articles/bloomrev/index.htm"/><rdf:li rdf:resource="http://www.ucl.ac.uk/oncology/MicroCore/HTML_resource/distances_popup.htm"/><rdf:li rdf:resource="http://www.cse.unsw.edu.au/~lambert/java/3d/hull.html"/><rdf:li rdf:resource="http://w3.impa.br/~apeixoto/topol_mesh.htm"/><rdf:li rdf:resource="http://www.voronoi.com/applications.htm"/><rdf:li rdf:resource="http://www-cgi.cs.cmu.edu/afs/cs/academic/class/15850c-s96/www/drysdale.txt"/><rdf:li rdf:resource="http://www.informatik.uni-koeln.de/old-ls_juenger/projects/dust.html"/><rdf:li rdf:resource="http://www.gris.uni-tuebingen.de/gris/proj/dt/dteng.html"/><rdf:li rdf:resource="http://www.algosort.com/"/></rdf:Seq></items></channel><item rdf:about="http://www.nist.gov/dads/"><title>Dictionary of Algorithms and Data Structures</title><description></description><link>http://www.nist.gov/dads/</link><dc:creator>armin_</dc:creator><dc:date>2007-10-16T07:33:30+02:00</dc:date><dc:subject>algorithms standards technology </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-10-16T07:33:30+02:00&#034; href=&#034;http://www.nist.gov/dads/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.nist.gov/dads/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/standards"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/technology"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.cmu.edu/~anind/"><title>Anind K. Dey</title><description></description><link>http://www.cs.cmu.edu/~anind/</link><dc:creator>armin_</dc:creator><dc:date>2006-11-22T13:22:16+01:00</dc:date><dc:subject>algorithms </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-11-22T13:22:16+01:00&#034; href=&#034;http://www.cs.cmu.edu/~anind/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.cs.cmu.edu/~anind/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.it.usyd.edu.au/~judy/Homec/personalisation.html"><title>Judy Kay - Personalisation research projects</title><description></description><link>http://www.it.usyd.edu.au/~judy/Homec/personalisation.html</link><dc:creator>armin_</dc:creator><dc:date>2006-11-20T16:53:51+01:00</dc:date><dc:subject>algorithms </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-11-20T16:53:51+01:00&#034; href=&#034;http://www.it.usyd.edu.au/~judy/Homec/personalisation.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.it.usyd.edu.au/~judy/Homec/personalisation.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.is.informatik.uni-duisburg.de/wiki/index.php/ASDL:User_Modelling"><title>ASDL:User Modelling - Wiki</title><description></description><link>http://www.is.informatik.uni-duisburg.de/wiki/index.php/ASDL:User_Modelling</link><dc:creator>armin_</dc:creator><dc:date>2006-11-20T16:53:51+01:00</dc:date><dc:subject>algorithms </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-11-20T16:53:51+01:00&#034; href=&#034;http://www.is.informatik.uni-duisburg.de/wiki/index.php/ASDL:User_Modelling&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.is.informatik.uni-duisburg.de/wiki/index.php/ASDL:User_Modelling&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item><item rdf:about="http://scholar.google.at/scholar?q=nearest+neighbor&amp;hl=de&amp;lr=&amp;scoring=r&amp;as_ylo=2001"><title>nearest neighbor - Google Scholar</title><description></description><link>http://scholar.google.at/scholar?q=nearest+neighbor&amp;hl=de&amp;lr=&amp;scoring=r&amp;as_ylo=2001</link><dc:creator>armin_</dc:creator><dc:date>2006-11-20T16:53:51+01:00</dc:date><dc:subject>algorithms </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-11-20T16:53:51+01:00&#034; href=&#034;http://scholar.google.at/scholar?q=nearest+neighbor&amp;amp;hl=de&amp;amp;lr=&amp;amp;scoring=r&amp;amp;as_ylo=2001&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://scholar.google.at/scholar?q=nearest+neighbor&amp;amp;hl=de&amp;amp;lr=&amp;amp;scoring=r&amp;amp;as_ylo=2001&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.statistical-pattern-recognition.net/"><title>Statistical Pattern Recognition</title><description></description><link>http://www.statistical-pattern-recognition.net/</link><dc:creator>armin_</dc:creator><dc:date>2006-11-20T16:53:51+01:00</dc:date><dc:subject>algorithms </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-11-20T16:53:51+01:00&#034; href=&#034;http://www.statistical-pattern-recognition.net/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.statistical-pattern-recognition.net/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item><item rdf:about="http://en.wikipedia.org/wiki/Similarity_matrix"><title>Similarity matrix - Wikipedia, the free encyclopedia</title><description></description><link>http://en.wikipedia.org/wiki/Similarity_matrix</link><dc:creator>armin_</dc:creator><dc:date>2006-11-20T16:53:51+01:00</dc:date><dc:subject>algorithms </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-11-20T16:53:51+01:00&#034; href=&#034;http://en.wikipedia.org/wiki/Similarity_matrix&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://en.wikipedia.org/wiki/Similarity_matrix&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.voronoi.com/"><title>Welcome to Voronoi.com</title><description></description><link>http://www.voronoi.com/</link><dc:creator>armin_</dc:creator><dc:date>2006-11-20T16:53:51+01:00</dc:date><dc:subject>algorithms </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-11-20T16:53:51+01:00&#034; href=&#034;http://www.voronoi.com/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.voronoi.com/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item><item rdf:about="http://coe.sdsu.edu/eet/Articles/bloomrev/index.htm"><title>Encyclopedia of Educational Technology</title><description></description><link>http://coe.sdsu.edu/eet/Articles/bloomrev/index.htm</link><dc:creator>armin_</dc:creator><dc:date>2006-11-20T16:53:51+01:00</dc:date><dc:subject>algorithms </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-11-20T16:53:51+01:00&#034; href=&#034;http://coe.sdsu.edu/eet/Articles/bloomrev/index.htm&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://coe.sdsu.edu/eet/Articles/bloomrev/index.htm&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.ucl.ac.uk/oncology/MicroCore/HTML_resource/distances_popup.htm"><title>Distance Measures</title><description></description><link>http://www.ucl.ac.uk/oncology/MicroCore/HTML_resource/distances_popup.htm</link><dc:creator>armin_</dc:creator><dc:date>2006-11-20T16:53:51+01:00</dc:date><dc:subject>algorithms </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-11-20T16:53:51+01:00&#034; href=&#034;http://www.ucl.ac.uk/oncology/MicroCore/HTML_resource/distances_popup.htm&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.ucl.ac.uk/oncology/MicroCore/HTML_resource/distances_popup.htm&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cse.unsw.edu.au/~lambert/java/3d/hull.html"><title>Convex Hull Algorithms</title><description></description><link>http://www.cse.unsw.edu.au/~lambert/java/3d/hull.html</link><dc:creator>armin_</dc:creator><dc:date>2006-10-27T14:08:19+02:00</dc:date><dc:subject>algorithms </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-10-27T14:08:19+02:00&#034; href=&#034;http://www.cse.unsw.edu.au/~lambert/java/3d/hull.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.cse.unsw.edu.au/~lambert/java/3d/hull.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item><item rdf:about="http://w3.impa.br/~apeixoto/topol_mesh.htm"><title>topol_mesh</title><description></description><link>http://w3.impa.br/~apeixoto/topol_mesh.htm</link><dc:creator>armin_</dc:creator><dc:date>2006-10-27T14:07:59+02:00</dc:date><dc:subject>algorithms </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-10-27T14:07:59+02:00&#034; href=&#034;http://w3.impa.br/~apeixoto/topol_mesh.htm&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://w3.impa.br/~apeixoto/topol_mesh.htm&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.voronoi.com/applications.htm"><title>Voronoi Applications</title><description></description><link>http://www.voronoi.com/applications.htm</link><dc:creator>armin_</dc:creator><dc:date>2006-10-27T13:42:42+02:00</dc:date><dc:subject>algorithms </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-10-27T13:42:42+02:00&#034; href=&#034;http://www.voronoi.com/applications.htm&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.voronoi.com/applications.htm&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www-cgi.cs.cmu.edu/afs/cs/academic/class/15850c-s96/www/drysdale.txt"><title>Voronoi Diagrams: Applications from Archaology to Zoology</title><description></description><link>http://www-cgi.cs.cmu.edu/afs/cs/academic/class/15850c-s96/www/drysdale.txt</link><dc:creator>armin_</dc:creator><dc:date>2006-10-27T13:35:25+02:00</dc:date><dc:subject>algorithms </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-10-27T13:35:25+02:00&#034; href=&#034;http://www-cgi.cs.cmu.edu/afs/cs/academic/class/15850c-s96/www/drysdale.txt&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www-cgi.cs.cmu.edu/afs/cs/academic/class/15850c-s96/www/drysdale.txt&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.informatik.uni-koeln.de/old-ls_juenger/projects/dust.html"><title>The program DUST</title><description></description><link>http://www.informatik.uni-koeln.de/old-ls_juenger/projects/dust.html</link><dc:creator>armin_</dc:creator><dc:date>2006-10-27T09:21:51+02:00</dc:date><dc:subject>algorithms </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-10-27T09:21:51+02:00&#034; href=&#034;http://www.informatik.uni-koeln.de/old-ls_juenger/projects/dust.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.informatik.uni-koeln.de/old-ls_juenger/projects/dust.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.gris.uni-tuebingen.de/gris/proj/dt/dteng.html"><title>Delaunay triangulations</title><description></description><link>http://www.gris.uni-tuebingen.de/gris/proj/dt/dteng.html</link><dc:creator>armin_</dc:creator><dc:date>2006-10-27T09:18:56+02:00</dc:date><dc:subject>algorithms </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-10-27T09:18:56+02:00&#034; href=&#034;http://www.gris.uni-tuebingen.de/gris/proj/dt/dteng.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.gris.uni-tuebingen.de/gris/proj/dt/dteng.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.algosort.com/"><title>Computer Programming Algorithms Directory</title><description>A directory of web pages describing computer programming algorithms (often with code samples)</description><link>http://www.algosort.com/</link><dc:creator>armin_</dc:creator><dc:date>2006-10-25T15:33:56+02:00</dc:date><dc:subject>algorithms </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;A directory of web pages describing computer programming algorithms (often with code samples)&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/></rdf:Bag></taxo:topics></item></rdf:RDF>