<?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/author/Obermayer"><title>BibSonomy publications for /author/Obermayer</title><link>BibSonomypublrss/author/Obermayer</link><description>BibSonomy RSS feed for /author/Obermayer</description><dc:date>2012-02-16T04:51:44+01:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2300713ac0b6284882f5f51cd28986243/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2fbe253d82413cdec56ec528eb076761b/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2304cb641fb892b2e98b28a993f9a67c7/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/28e9c44b6f7f8ad7bfea99c1c1a0784a5/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/27cb50b40431cf28ffd5f3d52c47cb66d/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f6bfab27f721f797cc1de0f1a6a5b25b/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20962df23706bf1f53281175c27470f10/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2850286e0efa0705bac12a07a8d22a1f2/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2e830e708c1f6b082628ee7f3bf9c2d48/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/27ac6cd7d96cce39a5240ae4280f614b3/beate"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/29d2a5013b8ae1f80a9eb2cc92294beb3/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/237b0973c05c329bb43d3f68cbe8d7067/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25ce4994d41d8bcf06921a39f37c72931/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25fac0ef5146818367ab6bbf8424de906/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20198d1d7021e31f517e261d6ba780c08/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/21d419e2b30fe5085d2e525e963283316/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2076e49c648e8c2b48d9e2da0e1e87c72/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f481cd227c297fa0b4d4e24e702ed625/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2b7ed701eaf9aa1dc4a5c98c5f6351fb8/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/248ed26cbb0010602eacf5ef8c863cb00/dblp"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/2300713ac0b6284882f5f51cd28986243/dblp"><title>Tripartite community structure in social bookmarking data.</title><link>http://www.bibsonomy.org/bibtex/2300713ac0b6284882f5f51cd28986243/dblp</link><dc:creator>dblp</dc:creator><dc:date>2012-02-06T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Neubauer&#034;&gt;Nicolas Neubauer&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;The New Review of Hypermedia and Multimedia&lt;/em&gt; &lt;em&gt;17(3):267-294&lt;/em&gt; (&lt;em&gt;2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2fbe253d82413cdec56ec528eb076761b/dblp"><title>Soft nearest prototype classification.</title><link>http://www.bibsonomy.org/bibtex/2fbe253d82413cdec56ec528eb076761b/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-16T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Seo&#034;&gt;Sambu Seo&lt;/a&gt;, &lt;a href=&#034;/author/Bode&#034;&gt;Mathias Bode&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;IEEE Transactions on Neural Networks&lt;/em&gt; &lt;em&gt;14(2):390-398&lt;/em&gt; (&lt;em&gt;2003&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2304cb641fb892b2e98b28a993f9a67c7/dblp"><title>Graph Quantization</title><link>http://www.bibsonomy.org/bibtex/2304cb641fb892b2e98b28a993f9a67c7/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Jain&#034;&gt;Brijnesh J. Jain&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2010&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/28e9c44b6f7f8ad7bfea99c1c1a0784a5/dblp"><title>Accelerating Competitive Learning Graph Quantization</title><link>http://www.bibsonomy.org/bibtex/28e9c44b6f7f8ad7bfea99c1c1a0784a5/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Jain&#034;&gt;Brijnesh J. Jain&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2010&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/27cb50b40431cf28ffd5f3d52c47cb66d/dblp"><title>Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem</title><link>http://www.bibsonomy.org/bibtex/27cb50b40431cf28ffd5f3d52c47cb66d/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Jain&#034;&gt;Brijnesh J. Jain&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2f6bfab27f721f797cc1de0f1a6a5b25b/dblp"><title>A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem</title><link>http://www.bibsonomy.org/bibtex/2f6bfab27f721f797cc1de0f1a6a5b25b/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Jain&#034;&gt;Brijnesh J. Jain&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2009&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/20962df23706bf1f53281175c27470f10/dblp"><title>Elkan&#039;s k-Means for Graphs</title><link>http://www.bibsonomy.org/bibtex/20962df23706bf1f53281175c27470f10/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Jain&#034;&gt;Brijnesh J. Jain&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2009&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2850286e0efa0705bac12a07a8d22a1f2/dblp"><title>A Unified Framework for Risk-sensitive Markov Decision Processes with Finite State and Action Spaces</title><link>http://www.bibsonomy.org/bibtex/2850286e0efa0705bac12a07a8d22a1f2/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Shen&#034;&gt;Yun Shen&lt;/a&gt;, &lt;a href=&#034;/author/Grünewälder&#034;&gt;Steffen Grünewälder&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2e830e708c1f6b082628ee7f3bf9c2d48/dblp"><title>Probabilistic prototype models for attributed graphs</title><link>http://www.bibsonomy.org/bibtex/2e830e708c1f6b082628ee7f3bf9c2d48/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Srinivasan&#034;&gt;S. Deepak Srinivasan&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/27ac6cd7d96cce39a5240ae4280f614b3/beate"><title>Hyperincident connected components of tagging networks</title><link>http://www.bibsonomy.org/bibtex/27ac6cd7d96cce39a5240ae4280f614b3/beate</link><dc:creator>beate</dc:creator><dc:date>2011-11-30T07:55:16+01:00</dc:date><dc:subject>bibsonomy-dataset networks spam tagging </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Neubauer&#034;&gt;Nicolas Neubauer&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;SIGWEB Newsl.&lt;/em&gt;  (&lt;em&gt;September 2009&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bibsonomy-dataset"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/spam"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tagging"/></rdf:Bag></taxo:topics><description>Hyperincident connected components of tagging networks</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/29d2a5013b8ae1f80a9eb2cc92294beb3/dblp"><title>Distance Measures in Query Space: How Strongly to Use Feedback From Past Queries.</title><link>http://www.bibsonomy.org/bibtex/29d2a5013b8ae1f80a9eb2cc92294beb3/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-24T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Neubauer&#034;&gt;Nicolas Neubauer&lt;/a&gt;, &lt;a href=&#034;/author/Scheel&#034;&gt;Christian Scheel&lt;/a&gt;, &lt;a href=&#034;/author/Albayrak&#034;&gt;Sahin Albayrak&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Web Intelligence, &lt;/em&gt;&lt;em&gt;page 607-613. &lt;/em&gt;&lt;em&gt;IEEE Computer Society, &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/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/237b0973c05c329bb43d3f68cbe8d7067/dblp"><title>Support Vector Machines for Dyadic Data.</title><link>http://www.bibsonomy.org/bibtex/237b0973c05c329bb43d3f68cbe8d7067/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-17T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Hochreiter&#034;&gt;Sepp Hochreiter&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Neural Computation&lt;/em&gt; &lt;em&gt;18(6):1472-1510&lt;/em&gt; (&lt;em&gt;2006&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/25ce4994d41d8bcf06921a39f37c72931/dblp"><title>The Joint Development of Orientation and Ocular Dominance: Role of Constraints.</title><link>http://www.bibsonomy.org/bibtex/25ce4994d41d8bcf06921a39f37c72931/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-17T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Piepenbrock&#034;&gt;Christian Piepenbrock&lt;/a&gt;, &lt;a href=&#034;/author/Ritter&#034;&gt;Helge Ritter&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Neural Computation&lt;/em&gt; &lt;em&gt;9(5):959-970&lt;/em&gt; (&lt;em&gt;1997&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/25fac0ef5146818367ab6bbf8424de906/dblp"><title>Soft Learning Vector Quantization.</title><link>http://www.bibsonomy.org/bibtex/25fac0ef5146818367ab6bbf8424de906/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-17T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Seo&#034;&gt;Sambu Seo&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Neural Computation&lt;/em&gt; &lt;em&gt;15(7):1589-1604&lt;/em&gt; (&lt;em&gt;2003&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/20198d1d7021e31f517e261d6ba780c08/dblp"><title>Models of orientation and ocular dominance columns in the visual cortex: a critical comparison.</title><link>http://www.bibsonomy.org/bibtex/20198d1d7021e31f517e261d6ba780c08/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-17T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Erwin&#034;&gt;E. Erwin&lt;/a&gt;, &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt;,  and &lt;a href=&#034;/author/Schulten&#034;&gt;Klaus Schulten&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Neural Computation&lt;/em&gt; &lt;em&gt;7(3):425-468&lt;/em&gt; (&lt;em&gt;1995&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/21d419e2b30fe5085d2e525e963283316/dblp"><title>Singularities in Primate Orientation Maps.</title><link>http://www.bibsonomy.org/bibtex/21d419e2b30fe5085d2e525e963283316/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-17T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt;,  and &lt;a href=&#034;/author/Blasdel&#034;&gt;Gary G. Blasdel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Neural Computation&lt;/em&gt; &lt;em&gt;9(3):555-575&lt;/em&gt; (&lt;em&gt;1997&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2076e49c648e8c2b48d9e2da0e1e87c72/dblp"><title>An Analysis of Orientation and Ocular Dominance Patterns in the Visual Cortex of Cats and Ferrets.</title><link>http://www.bibsonomy.org/bibtex/2076e49c648e8c2b48d9e2da0e1e87c72/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-17T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Müller&#034;&gt;T. Müller&lt;/a&gt;, &lt;a href=&#034;/author/Stetter&#034;&gt;Martin Stetter&lt;/a&gt;, &lt;a href=&#034;/author/Hübener&#034;&gt;Mark Hübener&lt;/a&gt;, &lt;a href=&#034;/author/Sengpiel&#034;&gt;F. Sengpiel&lt;/a&gt;, &lt;a href=&#034;/author/Bonhoeffer&#034;&gt;Tobias Bonhoeffer&lt;/a&gt;, &lt;a href=&#034;/author/Gödecke&#034;&gt;I. Gödecke&lt;/a&gt;, &lt;a href=&#034;/author/Chapman&#034;&gt;B. Chapman&lt;/a&gt;, &lt;a href=&#034;/author/Löwel&#034;&gt;Siegrid Löwel&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Neural Computation&lt;/em&gt; &lt;em&gt;12(11):2573-2595&lt;/em&gt; (&lt;em&gt;2000&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2f481cd227c297fa0b4d4e24e702ed625/dblp"><title>A Stochastic Self-Organizing Map for Proximity Data.</title><link>http://www.bibsonomy.org/bibtex/2f481cd227c297fa0b4d4e24e702ed625/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-17T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Graepel&#034;&gt;Thore Graepel&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Neural Computation&lt;/em&gt; &lt;em&gt;11(1):139-155&lt;/em&gt; (&lt;em&gt;1999&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2b7ed701eaf9aa1dc4a5c98c5f6351fb8/dblp"><title>Correlation Coefficients are Insufficient for Analyzing Spike Count Dependencies.</title><link>http://www.bibsonomy.org/bibtex/2b7ed701eaf9aa1dc4a5c98c5f6351fb8/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-10T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Onken&#034;&gt;Arno Onken&lt;/a&gt;, &lt;a href=&#034;/author/Grünewälder&#034;&gt;Steffen Grünewälder&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;NIPS, &lt;/em&gt;&lt;em&gt;page 1383-1391. &lt;/em&gt;&lt;em&gt;Curran Associates, Inc., &lt;/em&gt;(&lt;em&gt;2009&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/248ed26cbb0010602eacf5ef8c863cb00/dblp"><title>Large-scale simulations of self-organizing neural networks on parallel computers: application to biological modelling.</title><link>http://www.bibsonomy.org/bibtex/248ed26cbb0010602eacf5ef8c863cb00/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-09-09T00:00:00+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt;, &lt;a href=&#034;/author/Ritter&#034;&gt;Helge Ritter&lt;/a&gt;,  and &lt;a href=&#034;/author/Schulten&#034;&gt;Klaus Schulten&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Parallel Computing&lt;/em&gt; &lt;em&gt;14(3):381-404&lt;/em&gt; (&lt;em&gt;1990&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item></rdf:RDF>
