<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE rdf:RDF [
 <!ENTITY rdf 'http://www.w3.org/1999/02/22-rdf-syntax-ns#'>
 <!ENTITY rdfs 'http://www.w3.org/2000/01/rdf-schema#'>

 <!ENTITY swrc 'http://swrc.ontoware.org/ontology#'>
 <!ENTITY xsd 'http://www.w3.org/2001/XMLSchema#'>
]>

<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:cc="http://web.resource.org/cc/"
 xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:syn="http://purl.org/rss/1.0/modules/syndication/"
 xmlns:content="http://purl.org/rss/1.0/modules/content/"
 xmlns:admin="http://webns.net/mvcb/"
 xmlns:burst="http://xmlns.com/burst/0.1/"
 
 xmlns:rdfs="&rdfs;"
 xmlns:swrc="&swrc;"
 xmlns:xsd="&xsd;"
>

<channel rdf:about="http://www.bibsonomy.org/uri/bibtex/1af61cfa4342af108adb3cdf2c32feea0">
  <title>BibSonomy publications for /bibtex/1af61cfa4342af108adb3cdf2c32feea0</title>
  <link>http://www.bibsonomy.org/burst/bibtex/1af61cfa4342af108adb3cdf2c32feea0</link>
  <description>BibSonomy BuRST Feed for /bibtex/1af61cfa4342af108adb3cdf2c32feea0</description>
  <dc:date>2008-08-21T08:12:29+02:00</dc:date>

  <items>
    <rdf:Seq>
      <rdf:li rdf:resource="http://www.bibsonomy.org/uri/bibtex/21c0dcf75e5c12031501bee47f84fa4c6/sb3000"/>
      <rdf:li rdf:resource="http://www.bibsonomy.org/uri/bibtex/20eae52ed7b59a5ef17c41ad8073999d8/dblp"/>
      </rdf:Seq>
  </items>
</channel>

<item rdf:about="http://www.bibsonomy.org/uri/bibtex/21c0dcf75e5c12031501bee47f84fa4c6/sb3000">
    <title>On Graph Kernels: Hardness Results and Efficient Alternatives</title>
    <link>http://www.bibsonomy.org/bibtex/21c0dcf75e5c12031501bee47f84fa4c6/sb3000</link>
    <dc:creator>sb3000</dc:creator>
    <dc:date>2008-05-16T16:34:29+02:00</dc:date>
    <dc:subject>graph-kernels </dc:subject>
    <content:encoded>
	    <![CDATA[
        <div class="block">
	      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/21c0dcf75e5c12031501bee47f84fa4c6/sb3000">On Graph Kernels: Hardness Results and Efficient Alternatives</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Thomas <a href="http://www.bibsonomy.org/author/G%C3%A4rtner">Gärtner</a>         	     	 
        	  and Peter <a href="http://www.bibsonomy.org/author/Flach">Flach</a>         	     	 
        	  and Stefan <a href="http://www.bibsonomy.org/author/Wrobel">Wrobel</a>         	     	 
        	 </span> 
  <em>Computational Learning Theory and Kernel Machines --- Proceedings of the 16th Annual Conference on Computational Learning Theory and 7th Kernel Workshop (COLT/Kernel 2003) August 24-27, 2003, Washington, DC, USA</em>
    129--143
  (2003)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/sb3000/graph-kernels">graph-kernels</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/sb3000">sb3000</a> 
        
        
        on 2008-05-16 16:34:29 </span></div>
	    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph-kernels" />
        </rdf:Bag>
    </taxo:topics>
    <burst:publication>
      <swrc:InProceedings>
        <swrc:booktitle>Computational Learning Theory and Kernel Machines --- Proceedings of the 16th Annual Conference on Computational Learning Theory and 7th Kernel Workshop (COLT/Kernel 2003) August 24-27, 2003, Washington, DC, USA</swrc:booktitle><swrc:month>August</swrc:month><swrc:pages>129--143</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer, Berlin--Heidelberg, Germany"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>On Graph Kernels: Hardness Results and Efficient Alternatives</swrc:title><swrc:volume>2777</swrc:volume><swrc:year>2003</swrc:year><swrc:keywords>graph-kernels </swrc:keywords><swrc:date>2008-05-16 16:34:29.0</swrc:date><swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Thomas Gärtner" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Peter Flach" /></rdf:_2>
  <rdf:_3><swrc:Person swrc:name="Stefan Wrobel" /></rdf:_3>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Bernhard Schölkopf" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Manfred K. Warmuth" /></rdf:_2>
  </rdf:Seq>
</swrc:editor></swrc:InProceedings>  
    </burst:publication>
  </item>
<item rdf:about="http://www.bibsonomy.org/uri/bibtex/20eae52ed7b59a5ef17c41ad8073999d8/dblp">
    <title>On Graph Kernels: Hardness Results and Efficient Alternatives.</title>
    <description>dblp</description><link>http://www.bibsonomy.org/bibtex/20eae52ed7b59a5ef17c41ad8073999d8/dblp</link>
    <dc:creator>dblp</dc:creator>
    <dc:date>2003-11-27T00:00:00+01:00</dc:date>
    <dc:subject>dblp </dc:subject>
    <content:encoded>
	    <![CDATA[
        <div class="block">
	      <div class="bmtitle">

  <a href="http://www.bibsonomy.org/bibtex/20eae52ed7b59a5ef17c41ad8073999d8/dblp">On Graph Kernels: Hardness Results and Efficient Alternatives.</a>
</div>
<div class="bmdesc">
  <span style="color:#555555;"> 
    Thomas <a href="http://www.bibsonomy.org/author/G%C3%A4rtner">Gärtner</a>         	     	 
        	  and Peter A. <a href="http://www.bibsonomy.org/author/Flach">Flach</a>         	     	 
        	  and Stefan <a href="http://www.bibsonomy.org/author/Wrobel">Wrobel</a>         	     	 
        	 </span> 
  <em>COLT</em>
    129-143
  (2003)
</div>
<span class="bmmeta">
  
  
        to
        <span class="bmtags">
        <a href="http://www.bibsonomy.org/user/dblp/dblp">dblp</a>
        </span>
        

          by <a href="http://www.bibsonomy.org/user/dblp">dblp</a> 
        
        
        on 2003-11-27 00:00:00 </span></div>
	    ]]>
    </content:encoded>
    <taxo:topics>
      <rdf:Bag>
        <rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp" />
        </rdf:Bag>
    </taxo:topics>
    <burst:publication>
      <swrc:InProceedings>
        <swrc:booktitle>COLT</swrc:booktitle><swrc:crossref>conf/colt/2003</swrc:crossref><swrc:pages>129-143</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Lecture Notes in Computer Science</swrc:series><swrc:title>On Graph Kernels: Hardness Results and Efficient Alternatives.</swrc:title><swrc:volume>2777</swrc:volume><swrc:year>2003</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:date>2003-11-27 00:00:00.0</swrc:date><swrc:hasExtraField>
    <swrc:Field swrc:key="ee" swrc:value="http://springerlink.metapress.com/openurl.asp?genre=article&amp;issn=0302-9743&amp;volume=2777&amp;spage=129"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="isbn" swrc:value="3-540-40720-0"/>
  </swrc:hasExtraField>
<swrc:hasExtraField>
    <swrc:Field swrc:key="date" swrc:value="2003-11-27"/>
  </swrc:hasExtraField>
<swrc:author>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Thomas Gärtner" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Peter A. Flach" /></rdf:_2>
  <rdf:_3><swrc:Person swrc:name="Stefan Wrobel" /></rdf:_3>
  </rdf:Seq>
</swrc:author>

<swrc:editor>
  <rdf:Seq>
  <rdf:_1><swrc:Person swrc:name="Bernhard Schölkopf" /></rdf:_1>
  <rdf:_2><swrc:Person swrc:name="Manfred K. Warmuth" /></rdf:_2>
  </rdf:Seq>
</swrc:editor></swrc:InProceedings>  
    </burst:publication>
  </item>
</rdf:RDF>