<?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>davinci’s notebook &#187; SlideShare</title>
	<atom:link href="http://stargrads.net/blogs/davinci/tag/slideshare/feed/" rel="self" type="application/rss+xml" />
	<link>http://stargrads.net/blogs/davinci</link>
	<description>everything is an experiment</description>
	<lastBuildDate>Mon, 21 Mar 2011 18:31:14 +0000</lastBuildDate>
	<language>fa</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3</generator>
		<item>
		<title>Slides from TQC 2008</title>
		<link>http://stargrads.net/blogs/davinci/2009/08/slides-from-tqc-2008/</link>
		<comments>http://stargrads.net/blogs/davinci/2009/08/slides-from-tqc-2008/#comments</comments>
		<pubDate>Tue, 04 Aug 2009 05:17:59 +0000</pubDate>
		<dc:creator>davinci</dc:creator>
				<category><![CDATA[academic meetings]]></category>
		<category><![CDATA[something new every day]]></category>
		<category><![CDATA[discussions]]></category>
		<category><![CDATA[MIN-MAX trees]]></category>
		<category><![CDATA[NAND trees]]></category>
		<category><![CDATA[presentations]]></category>
		<category><![CDATA[quantum algorithms]]></category>
		<category><![CDATA[slides]]></category>
		<category><![CDATA[SlideShare]]></category>
		<category><![CDATA[talks]]></category>
		<category><![CDATA[TQC]]></category>

		<guid isPermaLink="false">http://stargrads.net/blogs/davinci/?p=1180</guid>
		<description><![CDATA[
In this post, I make my slides from TQC 2008 available online through SlideShare.  I also comment on presentation culture, and note some ideas I have about how to make my presentations more effective in the future.
]]></description>
			<content:encoded><![CDATA[<p>Last year, I gave a talk at <a href="http://www.brl.ntt.co.jp/tqc/2008/index.html"><abbr title="(Workshop on) Theory of Computation, Communication, and Cryptography">TQC</abbr></a> on &#8220;Quantum Algorithms for Evaluating <span style="font-variant: small-caps">Min-Max</span> Trees&#8221;<sup><a class='footnote' id='note-1180-1' href='#footnote-1180-CGY08'>[1]</a></sup>, co-authored by Dr. Richard Cleve, Dr. Dmitry Gavinsky, and myself.</p>
<p>In the talk, I presented an algorithm which combines the <span style="font-variant: small-caps">Nand</span> tree evaluation quantum algorithm of <a href="http://web.mit.edu/physics/facultyandstaff/faculty/edward_farhi.html">Farhi</a>, <a href="http://web.mit.edu/physics/facultyandstaff/faculty/jeffrey_goldstone.html">Goldstone</a>, and <a href="http://www.math.neu.edu/~Gutmann/">Gutmann</a><sup><a class='footnote' id='note-1180-2' href='#footnote-1180-FGG07'>[2]</a></sup> with <a href="http://en.wikipedia.org/wiki/Grover%27s_algorithm">Grover&#8217;s</a> search in a clever way (if I do say so myself) to evaluate <span style="font-variant: small-caps">Min-Max</span> trees, with the same asymptotic cost in queries as for <span style="font-variant: small-caps">Nand</span> trees.</p>
<p>I&#8217;ve uploaded the slides to <a href="http://www.slideshare.net/">SlideShare</a>, and also embedded them in this post below<span id="more-1180"></span>.  If I&#8217;ve done my job properly, they should be understandable without my accompanying narration to anyone with a background in computer science and a little knowledge of quantum computing.</p>
<p>I&#8217;ve attended many presentations in academia, and I&#8217;ve often wished that a presentation would be accompanied by a blog post or forum thread where the audience could review (or even <em>pre</em>view) the slides, and leave comments or engage in discussions with the presenter or with each other.</p>
<iframe src="http://www.slideshare.net/slideshow/embed_code/1805807" width="675" height="545" frameborder="0" marginwidth="0" marginheight="0" scrolling="no"></iframe><br/><br/>
<p>While a few people may stick around after a presentation for discussions, more often than not, what happens is that people generally disperse afterwards or turn their attention towards something else (especially at a conference, where a presentation might be immediately followed by another event).  Furthermore, people might not want to loiter around a discussion if they feel that they have nothing to contribute.  They might also not want to ask questions or make comments during the presentation itself if they feel that doing so would make them look ignorant, or if they think that their remarks might be taken negatively or embarrass the speaker, or if a proper response by the speaker would cut into the presentation&#8217;s allotted time.  </p>
<p>A forum where people can discuss a presentation after it is given, for an indefinite period of time, and where people can loiter and comment anonymously, would solve these problems &#8212; and perhaps inspire more discussions, and more fruitful ones, than currently take place.</p>
<p>The next time I give a presentation, I&#8217;ll try to implement the ideas I&#8217;ve written about in this post.</p>
<p>&#8211; davinci 11739</p>
<img src="http://stargrads.net/blogs/davinci/?ak_action=api_record_view&id=1180&type=feed" alt="" /><p>No related posts.</p>]]></content:encoded>
			<wfw:commentRss>http://stargrads.net/blogs/davinci/2009/08/slides-from-tqc-2008/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

