<?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>Nam H. Pham</title>
	<atom:link href="http://www.namhpham.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.namhpham.com</link>
	<description>Welcome to my world</description>
	<lastBuildDate>Fri, 09 Jul 2010 17:56:31 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
		<item>
		<title>How to do laundry</title>
		<link>http://www.namhpham.com/2010/07/how-to-do-laundry/</link>
		<comments>http://www.namhpham.com/2010/07/how-to-do-laundry/#comments</comments>
		<pubDate>Fri, 09 Jul 2010 17:56:31 +0000</pubDate>
		<dc:creator>NamPham</dc:creator>
				<category><![CDATA[Daily Life]]></category>

		<guid isPermaLink="false">http://www.namhpham.com/?p=618</guid>
		<description><![CDATA[Sometimes I get confused how to choose wash cycle and dry cycle ? how to separate clothes correctly ? when to wash in cold/warm/hot water ? what is normal/delicate/permanent press ? etc It&#8217;s not a rocket science but very easy to forget and wrongly choose. Here is some experiences I collected from some websites and [...]]]></description>
		<wfw:commentRss>http://www.namhpham.com/2010/07/how-to-do-laundry/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>ASE 2010 Paper Notification</title>
		<link>http://www.namhpham.com/2010/06/ase-2010-paper-notification/</link>
		<comments>http://www.namhpham.com/2010/06/ase-2010-paper-notification/#comments</comments>
		<pubDate>Fri, 11 Jun 2010 22:30:41 +0000</pubDate>
		<dc:creator>NamPham</dc:creator>
				<category><![CDATA[Research]]></category>

		<guid isPermaLink="false">http://www.namhpham.com/?p=513</guid>
		<description><![CDATA[Dear Nam, Tung, Hoan and Tien, We are pleased to inform you that your paper &#8220;Detection of Recurring Software Vulnerabilities&#8221; (Paper-ID: ????) has been accepted for publication as full paper in the proceedings of the 25nd IEEE/ACM International Conference on Automated Software Engineering (ASE 2010). All papers went through a rigorous reviewing process and each [...]]]></description>
		<wfw:commentRss>http://www.namhpham.com/2010/06/ase-2010-paper-notification/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Majority Element</title>
		<link>http://www.namhpham.com/2010/06/majority-element/</link>
		<comments>http://www.namhpham.com/2010/06/majority-element/#comments</comments>
		<pubDate>Wed, 02 Jun 2010 15:41:50 +0000</pubDate>
		<dc:creator>NamPham</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Daily Life]]></category>

		<guid isPermaLink="false">http://www.namhpham.com/?p=495</guid>
		<description><![CDATA[This is a very interesting question I found in CareerCup.com (link): Given an unsorted array of n numbers, find the number that appears more than n/2 times. Do it in O(n) time and O(1) space. First, I did not come up with the solution. The solution is described here. Second, the idea is as follow: [...]]]></description>
		<wfw:commentRss>http://www.namhpham.com/2010/06/majority-element/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Summer Road Trip 2010</title>
		<link>http://www.namhpham.com/2010/06/summer-road-trip-2010/</link>
		<comments>http://www.namhpham.com/2010/06/summer-road-trip-2010/#comments</comments>
		<pubDate>Tue, 01 Jun 2010 06:28:37 +0000</pubDate>
		<dc:creator>NamPham</dc:creator>
				<category><![CDATA[Daily Life]]></category>

		<guid isPermaLink="false">http://www.namhpham.com/?p=490</guid>
		<description><![CDATA[Hi, I just had a wonderful 6000-mile-road trip with my friends to west coast. We had a lot of fun there. I tried to capture all moments we had during the road trip. Please visit here for more pictures of our wonderful time. Happy Memorial Day !!!]]></description>
		<wfw:commentRss>http://www.namhpham.com/2010/06/summer-road-trip-2010/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Ask Gayle: What can a student now do to prep for a programming position?</title>
		<link>http://www.namhpham.com/2010/05/ask-gayle-what-can-a-student-now-do-to-prep-for-a-programming-position/</link>
		<comments>http://www.namhpham.com/2010/05/ask-gayle-what-can-a-student-now-do-to-prep-for-a-programming-position/#comments</comments>
		<pubDate>Sun, 30 May 2010 14:30:33 +0000</pubDate>
		<dc:creator>NamPham</dc:creator>
				<category><![CDATA[Daily Life]]></category>

		<guid isPermaLink="false">http://www.namhpham.com/?p=481</guid>
		<description><![CDATA[Hi everyone, It has been a while since my last post. I just had an awesome vacation with my friends. I feel so fresh right now This is an useful article about how to prepare for a job in CareerCup (link). I hope you enjoy it. Hi Gayle, I am an international student from India [...]]]></description>
		<wfw:commentRss>http://www.namhpham.com/2010/05/ask-gayle-what-can-a-student-now-do-to-prep-for-a-programming-position/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
