<?xml version="1.0" encoding="UTF-8"?><rss version="0.92">
<channel>
	<title>Sound Science</title>
	<link>http://www.soundscience.net</link>
	<description></description>
	<lastBuildDate>Wed, 22 Feb 2012 09:14:02 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	<!-- generator="WordPress/3.0.1" -->

	<item>
		<title>Lecture 7 &#124; Programming Paradigms (Stanford)</title>
		<description><![CDATA[Lecture by Professor Jerry man for Pro&#103&#114&#97mming Paradigms (CS107) in the businessman Univers&#105&#116&#121 Computer Science department. In this lecture, Pro&#102&#46&#32man continues his reproval on the C planning modul&#101&#32&#97nd generic stacks. Programming Paradigms (CS107) i&#110&#116&#114oduces individualist planning languages, including&#32&#67&#44 Assembly, C++, Concurrent Programming, Scheme, an&#100&#32&#80ython. The collection aims to inform students how &#116&#111&#32indite cipher for apiece [...]]]></description>
		<link>http://www.soundscience.net/lecture-7-programming-paradigms-stanford.html</link>
			</item>
	<item>
		<title>Kate&#8217;s Story</title>
		<description><![CDATA[Kate was the prototypal mortal in a co&#110&#116&#105nual nonsexual land to be presented a tomography s&#99&#97&#110. Though physically insensitive and unable to comm&#117&#110&#105cate, the construe showed unheralded mentality act&#105&#118&#105ty.]]></description>
		<link>http://www.soundscience.net/kates-story.html</link>
			</item>
	<item>
		<title>Algorithms Lesson 6: Big O, Big Omega, and Big Theta Notation</title>
		<description><![CDATA[xoax.net For this algorithms recording&#32&#108&#101sson, we vindicate and shew the important asymptot&#105&#99&#32extent related with activity formula performance: &#98&#111&#117nteous O, bounteous omega, and bounteous theta. in&#32&#102&#111rmula analysis, we are more with how an formula sc&#97&#108&#101s than the literal instance of execution. This is &#115&#111&#109etimes referred to as complexness analysis. Lesson&#32&#112&#97ge: xoax.net Please accede every questions to [...]]]></description>
		<link>http://www.soundscience.net/algorithms-lesson-6-big-o-big-omega-and-big-theta-notation.html</link>
			</item>
	<item>
		<title>Lecture 4 &#8211; Minimizing Finite State Machines (Part 1/9)</title>
		<description><![CDATA[All rights distant for www.aduni.org P&#117&#98&#108ished low the Creative Commons Attribution-ShareAl&#105&#107&#101 authorise creativecommons.org Tutorials by Instru&#99&#116&#111r: Shai Simonson. www.stonehill.edu Visit the inst&#97&#108&#108ation at: www.coderisland.com Follow us on twirp w&#119&#119&#46twitter.com Follow our Rss Feed: www.coderisland.c&#111&#109&#32Become a follower on Facebook: www.facebook.com]]></description>
		<link>http://www.soundscience.net/lecture-4-minimizing-finite-state-machines-part-19.html</link>
			</item>
	<item>
		<title>Lec-4 C Programming-III</title>
		<description><![CDATA[Lecture Series on Programming and Data&#32&#83&#116ructure by Dr.PP Chakraborty, Department of Comput&#101&#114&#32Science and Engineering, IIT Kharagpur. For more i&#110&#102&#111 on NPTEL meet nptel.iitm.ac.in]]></description>
		<link>http://www.soundscience.net/lec-4-c-programming-iii.html</link>
			</item>
	<item>
		<title>2-3 Tree Insertion</title>
		<description><![CDATA[How to append values into a 2-3 tree. &#84&#104&#105s recording is diffuse low the Creative Commons At&#116&#114&#105bution 2.5 Canada License. creativecommons.org]]></description>
		<link>http://www.soundscience.net/2-3-tree-insertion.html</link>
			</item>
	<item>
		<title>Lecture 4 &#124; Machine Learning (Stanford)</title>
		<description><![CDATA[Lecture by Professor saint Ng for Mach&#105&#110&#101 Learning (CS 229) in the businessman Computer Sci&#101&#110&#99e department. Professor Ng lectures on Newton&#8217;s method, function&#32&#102&#97milies, and unspecialised linelike models and how &#116&#104&#101y colligate to organisation learning. This instruc&#116&#105&#111n provides a panoptic launching to organisation ac&#113&#117&#105sition and statistical ornament recognition. Topic&#115&#32&#97llow supervised learning, unattended learning, acq&#117&#105&#115ition theory, approval [...]]]></description>
		<link>http://www.soundscience.net/lecture-4-machine-learning-stanford.html</link>
			</item>
	<item>
		<title>Lecture &#8211; 4 Relational Model</title>
		<description><![CDATA[Lecture Series on Database Management &#83&#121&#115tem by Dr.S.Srinath, Department of Computer Scienc&#101&#32&#038; Engineering&#32&#44&#73IIT Banglore. For more info on NPTEL meet nptel.ii&#116&#109&#46ac.in]]></description>
		<link>http://www.soundscience.net/lecture-4-relational-model.html</link>
			</item>
	<item>
		<title>Lecture 12 &#124; Machine Learning (Stanford)</title>
		<description><![CDATA[Lecture by Professor saint Ng for Mach&#105&#110&#101 Learning (CS 229) in the businessman Computer Sci&#101&#110&#99e department. Professor Ng discusses unattended ac&#113&#117&#105sition in the environment of clustering, Jensen&#8217;s inequality, va&#114&#105&#101ty of Gaussians, and expectation-maximization. Thi&#115&#32&#105nstruction provides a panoptic launching to organi&#115&#97&#116ion acquisition and statistical ornament recogniti&#111&#110&#46 Topics allow supervised learning, unattended lear&#110&#105&#110g, acquisition theory, approval acquisition [...]]]></description>
		<link>http://www.soundscience.net/lecture-12-machine-learning-stanford.html</link>
			</item>
	<item>
		<title>Lecture &#8211; 3 Queues and Linked Lists</title>
		<description><![CDATA[Lecture Series on Data Structures and &#65&#108&#103orithms by Dr. Naveen Garg, Department of Computer&#32&#83&#99ience and Engineering ,IIT Delhi. For more info on&#32&#78&#80TEL meet nptel.iitm.ac.in]]></description>
		<link>http://www.soundscience.net/lecture-3-queues-and-linked-lists.html</link>
			</item>
</channel>
</rss>

