<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Suresh Venkatasubramanian &#187; Column</title>
	<atom:link href="http://www.cs.utah.edu/~suresh/web/tag/column/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.cs.utah.edu/~suresh/web</link>
	<description></description>
	<lastBuildDate>Mon, 23 Sep 2013 07:42:03 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.5.1</generator>
		<item>
		<title>Moving heaven and earth: distances between distributions</title>
		<link>http://www.cs.utah.edu/~suresh/web/2013/09/16/moving-heaven-and-earth-distances-between-distributions/</link>
		<comments>http://www.cs.utah.edu/~suresh/web/2013/09/16/moving-heaven-and-earth-distances-between-distributions/#comments</comments>
		<pubDate>Mon, 16 Sep 2013 21:17:02 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Papers]]></category>
		<category><![CDATA[Column]]></category>

		<guid isPermaLink="false">http://www.cs.utah.edu/~suresh/web/?p=444</guid>
		<description><![CDATA[[author]Suresh Venkatasubramanian[/author] SIGACT News vol 44, no. 3. Abstract: This column comes in two parts. In the first, I discuss various ways of defining distances between distributions. In the second, Jeff Erickson (chair of the SoCG steering committee) discusses some matters related to the relationship between ACM and the Symposium on Computational Geometry. Links: PDF]]></description>
				<content:encoded><![CDATA[<p>[author]Suresh Venkatasubramanian[/author]<br />
SIGACT News vol 44, no. 3.<br />
<span id="more-444"></span></p>
<p>Abstract:</p>
<div title="Page 1">
<div>
<div>
<p>This column comes in two parts. In the first, I discuss various ways of defining distances between distributions. In the second, Jeff Erickson (chair of the SoCG steering committee) discusses some matters related to the relationship between ACM and the Symposium on Computational Geometry.</p>
<p>Links: <a href="http://www.cs.utah.edu/~suresh/papers/column/kernel/kernel.pdf">PDF</a></p>
</div>
</div>
</div>
]]></content:encoded>
			<wfw:commentRss>http://www.cs.utah.edu/~suresh/web/2013/09/16/moving-heaven-and-earth-distances-between-distributions/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>New Developments in Matrix Factorization.</title>
		<link>http://www.cs.utah.edu/~suresh/web/2013/03/13/new-developments-in-matrix-factorization/</link>
		<comments>http://www.cs.utah.edu/~suresh/web/2013/03/13/new-developments-in-matrix-factorization/#comments</comments>
		<pubDate>Thu, 14 Mar 2013 04:33:18 +0000</pubDate>
		<dc:creator>suresh</dc:creator>
				<category><![CDATA[Papers]]></category>
		<category><![CDATA[Column]]></category>

		<guid isPermaLink="false">http://www.cs.utah.edu/~suresh/web/?p=404</guid>
		<description><![CDATA[SIGACT News 44 (1), March 2013. Notes: the published version of the article has a few errors. Moitra&#8217;s SODA paper improves the running time from $O((nm)^{2^r r^2})$ to $O((nm)^{r^2})$, which is considerably stronger than what was reported in the article. The correct lower bound for computing a nonnegative factorization (assuming ETH) is $O((nm)^{o(r)})$. This link [...]]]></description>
				<content:encoded><![CDATA[<p><a href="http://dl.acm.org/citation.cfm?doid=2447712.2447732">SIGACT News 44 (1), March 2013.</a></p>
<p>Notes: the published version of the article has a few errors.</p>
<ul>
<li>Moitra&#8217;s SODA paper improves the running time from $O((nm)^{2^r r^2})$ to $O((nm)^{r^2})$, which is considerably stronger than what was reported in the article.</li>
<li>The correct lower bound for computing a nonnegative factorization (assuming ETH) is $O((nm)^{o(r)})$.</li>
</ul>
<p>This link (<a href="http://www.cs.utah.edu/~suresh/papers/column/nmf/nmf-mod.pdf">PDF</a>) has the corrected article. Thanks to Ankur Moitra for pointing out the errors.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.cs.utah.edu/~suresh/web/2013/03/13/new-developments-in-matrix-factorization/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
	</channel>
</rss>