<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:burst="http://xmlns.com/burst/0.1/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns="http://purl.org/rss/1.0/" xmlns:admin="http://webns.net/mvcb/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:cc="http://web.resource.org/cc/"><channel rdf:about="http://www.bibsonomy.org/user/nepomuk/from:bdarla"><title>BibSonomy publications for /user/nepomuk/from:bdarla</title><link>BibSonomypublrss/user/nepomuk/from:bdarla</link><description>BibSonomy RSS feed for /user/nepomuk/from:bdarla</description><dc:date>2012-02-16T21:34:32+01:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/288e74a2c6c5f572063c5f6765be1a550/nepomuk"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2a7204f03cc1883586ffef45dc89b1a34/nepomuk"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/272d4cd48bdeddce4e4cf015cb8a9a326/nepomuk"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20ae68a9372c8e208e8c433897b37a737/nepomuk"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/288e74a2c6c5f572063c5f6765be1a550/nepomuk"><title>LSH At Large -- Distributed KNN Search in High Dimensions</title><link>http://www.bibsonomy.org/bibtex/288e74a2c6c5f572063c5f6765be1a550/nepomuk</link><dc:creator>nepomuk</dc:creator><dc:date>2008-07-28T06:44:49+02:00</dc:date><dc:subject>dimensionality from:bdarla high knn nearest neighbor p2p search </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Haghani&#034;&gt;Philippe Cudre-Mauroux Karl Aberer Parisa Haghani&lt;/a&gt; &lt;/span&gt;(&lt;em&gt;2008&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dimensionality"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/from:bdarla"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/high"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/knn"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/nearest"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/neighbor"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/p2p"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2a7204f03cc1883586ffef45dc89b1a34/nepomuk"><title>LSH At Large -- Distributed KNN Search in High Dimensions</title><link>http://www.bibsonomy.org/bibtex/2a7204f03cc1883586ffef45dc89b1a34/nepomuk</link><dc:creator>nepomuk</dc:creator><dc:date>2008-07-28T06:41:48+02:00</dc:date><dc:subject>dimensionality from:bdarla high knn nearest neighbor p2p search </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Fratemali&#034;&gt;Christoph Koch Piero Fratemali&lt;/a&gt; (Eds.).
		 &lt;/span&gt;(&lt;em&gt;2008&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dimensionality"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/from:bdarla"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/high"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/knn"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/nearest"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/neighbor"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/p2p"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/272d4cd48bdeddce4e4cf015cb8a9a326/nepomuk"><title>LSH At Large -- Distributed KNN Search in High Dimensions</title><link>http://www.bibsonomy.org/bibtex/272d4cd48bdeddce4e4cf015cb8a9a326/nepomuk</link><dc:creator>nepomuk</dc:creator><dc:date>2008-07-28T06:39:42+02:00</dc:date><dc:subject>dimensionality from:bdarla high knn nearest neighbor p2p search </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Fratemali&#034;&gt;Christiph Koch Piero Fratemali&lt;/a&gt; (Eds.).
		 &lt;/span&gt;(&lt;em&gt;2008&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dimensionality"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/from:bdarla"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/high"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/knn"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/nearest"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/neighbor"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/p2p"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/20ae68a9372c8e208e8c433897b37a737/nepomuk"><title>Completeness Estimation of Range Queries in Structured Overlays</title><link>http://www.bibsonomy.org/bibtex/20ae68a9372c8e208e8c433897b37a737/nepomuk</link><dc:creator>nepomuk</dc:creator><dc:date>2007-06-25T12:07:43+02:00</dc:date><dc:subject>Karnstedt07Completeness from:bdarla </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Karnstedt&#034;&gt;Roman Schmidt Marcel Karnstedt&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proceedings of the 7th IEEE International Conference on Peer-to-Peer Computing, &lt;/em&gt;(&lt;em&gt;2007&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Karnstedt07Completeness"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/from:bdarla"/></rdf:Bag></taxo:topics></item></rdf:RDF>
