<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.3.3" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>
<channel>
	<title>Comments on: LarKC team first one to break the 100 billion triple barrier</title>
	<link>http://blog.larkc.eu/?p=1751</link>
	<description></description>
	<pubDate>Wed, 08 Sep 2010 22:00:13 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3.3</generator>
		<item>
		<title>By: LarKC weblog &#187; Blog Archive &#187; WebPIE wins the IEEE SCALE challenge!</title>
		<link>http://blog.larkc.eu/?p=1751#comment-121241</link>
		<dc:creator>LarKC weblog &#187; Blog Archive &#187; WebPIE wins the IEEE SCALE challenge!</dc:creator>
		<pubDate>Sat, 22 May 2010 21:19:57 +0000</pubDate>
		<guid>http://blog.larkc.eu/?p=1751#comment-121241</guid>
		<description>[...] more info on WebPIE, see the earlier blog entries here and here.  A recent blog entry explains how to run WebPIE on your own datasets, using the Amazon [...]</description>
		<content:encoded><![CDATA[<p>[&#8230;] more info on WebPIE, see the earlier blog entries here and here.  A recent blog entry explains how to run WebPIE on your own datasets, using the Amazon [&#8230;]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: LarKC weblog &#187; Blog Archive &#187; Billion-triple reasoning? Now for everybody with a credit-card!</title>
		<link>http://blog.larkc.eu/?p=1751#comment-120861</link>
		<dc:creator>LarKC weblog &#187; Blog Archive &#187; Billion-triple reasoning? Now for everybody with a credit-card!</dc:creator>
		<pubDate>Wed, 19 May 2010 18:13:16 +0000</pubDate>
		<guid>http://blog.larkc.eu/?p=1751#comment-120861</guid>
		<description>[...] the WebPIE infrence engine? WebPIE is the first inference engine that can do inference over 100billion(!) triples, and that can compute the full OWL Horst closure of Uniprot (1billion triples) in just over 6 [...]</description>
		<content:encoded><![CDATA[<p>[&#8230;] the WebPIE infrence engine? WebPIE is the first inference engine that can do inference over 100billion(!) triples, and that can compute the full OWL Horst closure of Uniprot (1billion triples) in just over 6 [&#8230;]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: LarKC weblog &#187; Blog Archive &#187; LarKC&#8217;s WebPIE Inference Engine makes it to the final rounds of the SCALE 2010 Challenge</title>
		<link>http://blog.larkc.eu/?p=1751#comment-100211</link>
		<dc:creator>LarKC weblog &#187; Blog Archive &#187; LarKC&#8217;s WebPIE Inference Engine makes it to the final rounds of the SCALE 2010 Challenge</dc:creator>
		<pubDate>Wed, 24 Feb 2010 11:21:08 +0000</pubDate>
		<guid>http://blog.larkc.eu/?p=1751#comment-100211</guid>
		<description>[...] The VUA team submitted the work lead by Jacopo Urbani and Spyros Kotoulas on WebPIE, an inference engine that can perform at Webscale. This MapReduce-based inference engine performs OWL Horst inference on datasets up to 100billion triples, as earlier reported here and here. [...]</description>
		<content:encoded><![CDATA[<p>[&#8230;] The VUA team submitted the work lead by Jacopo Urbani and Spyros Kotoulas on WebPIE, an inference engine that can perform at Webscale. This MapReduce-based inference engine performs OWL Horst inference on datasets up to 100billion triples, as earlier reported here and here. [&#8230;]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: The semantics of context &#124; semantic web</title>
		<link>http://blog.larkc.eu/?p=1751#comment-95631</link>
		<dc:creator>The semantics of context &#124; semantic web</dc:creator>
		<pubDate>Mon, 08 Feb 2010 02:20:07 +0000</pubDate>
		<guid>http://blog.larkc.eu/?p=1751#comment-95631</guid>
		<description>[...] huge knowledge bases in real time is not an straightforward task (though some people are achieving impressive results with  enormous database sizes, real-time is still a different beast). So far, the strategy that [...]</description>
		<content:encoded><![CDATA[<p>[&#8230;] huge knowledge bases in real time is not an straightforward task (though some people are achieving impressive results with  enormous database sizes, real-time is still a different beast). So far, the strategy that [&#8230;]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: The semantics of context &#124; Semantica Blog</title>
		<link>http://blog.larkc.eu/?p=1751#comment-89621</link>
		<dc:creator>The semantics of context &#124; Semantica Blog</dc:creator>
		<pubDate>Fri, 22 Jan 2010 14:46:07 +0000</pubDate>
		<guid>http://blog.larkc.eu/?p=1751#comment-89621</guid>
		<description>[...] huge knowledge bases in real time is not an straightforward task (though some people are achieving impressive results with  enormous database sizes, real-time is still a different beast). So far, the strategy that [...]</description>
		<content:encoded><![CDATA[<p>[&#8230;] huge knowledge bases in real time is not an straightforward task (though some people are achieving impressive results with  enormous database sizes, real-time is still a different beast). So far, the strategy that [&#8230;]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
