<?xml version="1.0" encoding="iso-8859-1" ?>
<rss version="2.0" xmlns:s="http://updates.zdnet.com/">
<channel>
	<title><![CDATA[bound Resources | ZDNet]]></title>
	<link><![CDATA[http://updates.zdnet.com/tags/bound.html]]></link>
	<description><![CDATA[White papers, case studies, technical articles, and blog posts relating to bound]]></description>
	<s:counts start="0" returned="7" found="7" />
	<language>en-us</language>
	<item>
		<title><![CDATA[Convergence Speed of Binary Interval Consensus]]></title>
		<link><![CDATA[http://whitepapers.zdnet.com/abstract.aspx?docid=1139937]]></link>
		<description><![CDATA[This paper considers the speed of convergence of an instance of the binary interval consensus, a distributed and decentralized algorithm for computing the quantized average value. With binary consensus problem, each node initially holds one of two states and the goal for each node is to correctly decide which one...]]></description>
		<s:doctype><![CDATA[White papers]]></s:doctype>
		<pubDate>Sat, 01 Aug 2009 00:00:00 -0700</pubDate>
		<category domain="http://updates.zdnet.com/tags/node.html"><![CDATA[Node]]></category>
		<category domain="http://updates.zdnet.com/tags/bound.html"><![CDATA[Bound]]></category>
		<category domain="http://updates.zdnet.com/tags/convergence.html"><![CDATA[Convergence]]></category>
		<category domain="http://updates.zdnet.com/tags/voip.html"><![CDATA[VOIP]]></category>
		<category domain="http://updates.zdnet.com/tags/telecommunications.html"><![CDATA[Telecommunications]]></category>
		<category domain="http://updates.zdnet.com/tags/networking.html"><![CDATA[Networking]]></category>
	</item>
	<item>
		<title><![CDATA[Domino Solitaire 1.5 (Windows)]]></title>
		<link><![CDATA[http://downloads.zdnet.com/abstract.aspx?docid=1105591]]></link>
		<description><![CDATA[Domino Solitaire DomiSol is a puzzle where 28 dominoes are placed to form a rectangle but you do not see their bounds. Your goal is to find these bounds by grouping the domino halves into a correct domino set. A logic challenge. Each game has at least one solution, the...]]></description>
		<s:doctype><![CDATA[Software downloads]]></s:doctype>
		<pubDate>Wed, 29 Jul 2009 00:00:00 -0700</pubDate>
		<category domain="http://updates.zdnet.com/tags/ibm+lotus+domino.html"><![CDATA[IBM Lotus Domino]]></category>
		<category domain="http://updates.zdnet.com/tags/microsoft+windows.html"><![CDATA[Microsoft Windows]]></category>
		<category domain="http://updates.zdnet.com/tags/bound.html"><![CDATA[Bound]]></category>
		<category domain="http://updates.zdnet.com/tags/domino.html"><![CDATA[Domino]]></category>
		<category domain="http://updates.zdnet.com/tags/anny.html"><![CDATA[Anny]]></category>
		<category domain="http://updates.zdnet.com/tags/games.html"><![CDATA[Games]]></category>
		<category domain="http://updates.zdnet.com/tags/e-mail+servers.html"><![CDATA[E-mail Servers]]></category>
		<category domain="http://updates.zdnet.com/tags/groupware.html"><![CDATA[Groupware]]></category>
		<category domain="http://updates.zdnet.com/tags/enterprise+software.html"><![CDATA[Enterprise Software]]></category>
		<category domain="http://updates.zdnet.com/tags/personal+technology.html"><![CDATA[Personal Technology]]></category>
		<category domain="http://updates.zdnet.com/tags/software.html"><![CDATA[Software]]></category>
	</item>
	<item>
		<title><![CDATA[Joint Source-Channel With Side Information Coding Error Exponents]]></title>
		<link><![CDATA[http://whitepapers.zdnet.com/abstract.aspx?docid=972267]]></link>
		<description><![CDATA[This paper studies the upper and the lower bounds on the joint source-channel coding error exponent with decoder side-information. The results in the paper are non-trivial extensions of the Csiszar's classical paper. Unlike the joint source-channel coding result, it is not obvious whether the lower bound and the upper bound...]]></description>
		<s:doctype><![CDATA[White papers]]></s:doctype>
		<pubDate>Fri, 06 Feb 2009 00:00:00 -0800</pubDate>
		<category domain="http://updates.zdnet.com/tags/hewlett-packard+co..html"><![CDATA[Hewlett-Packard Co.]]></category>
		<category domain="http://updates.zdnet.com/tags/bound.html"><![CDATA[Bound]]></category>
		<category domain="http://updates.zdnet.com/tags/error.html"><![CDATA[Error]]></category>
		<category domain="http://rss.financialcontent.com/stocksymbol">HPQ</category>
		<category domain="tickers">HPQ</category>
	</item>
	<item>
		<title><![CDATA[On the Rate Distortion Function of Bernoulli Gaussian Sequences]]></title>
		<link><![CDATA[http://whitepapers.zdnet.com/abstract.aspx?docid=972269]]></link>
		<description><![CDATA[This paper studies the rate distortion function of the i.i.d sequence of multiplications of a Bernoulli p random variable and a gaussian random variable ~ N (0,1). The paper uses a new technique in the derivation of the lower bound in which they establish the duality between channel coding and...]]></description>
		<s:doctype><![CDATA[White papers]]></s:doctype>
		<pubDate>Fri, 06 Feb 2009 00:00:00 -0800</pubDate>
		<category domain="http://updates.zdnet.com/tags/hewlett-packard+co..html"><![CDATA[Hewlett-Packard Co.]]></category>
		<category domain="http://updates.zdnet.com/tags/bound.html"><![CDATA[Bound]]></category>
		<category domain="http://updates.zdnet.com/tags/distortion+function.html"><![CDATA[Distortion Function]]></category>
		<category domain="http://updates.zdnet.com/tags/productivity.html"><![CDATA[Productivity]]></category>
		<category domain="http://rss.financialcontent.com/stocksymbol">HPQ</category>
		<category domain="tickers">HPQ</category>
	</item>
	<item>
		<title><![CDATA[Better Bounds for Online Load Balancing on Unrelated Machines]]></title>
		<link><![CDATA[http://whitepapers.zdnet.com/abstract.aspx?docid=375117]]></link>
		<description><![CDATA[This paper studies the problem of scheduling permanent jobs on un-related machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing under the Lp norm. It presents an improved upper bound for the greedy algorithm through simple analysis; this...]]></description>
		<s:doctype><![CDATA[White papers]]></s:doctype>
		<pubDate>Thu, 11 Oct 2007 00:00:00 -0700</pubDate>
		<category domain="http://updates.zdnet.com/tags/load+balancing.html"><![CDATA[Load Balancing]]></category>
		<category domain="http://updates.zdnet.com/tags/norm.html"><![CDATA[Norm]]></category>
		<category domain="http://updates.zdnet.com/tags/bound.html"><![CDATA[Bound]]></category>
		<category domain="http://updates.zdnet.com/tags/university+of+patras.html"><![CDATA[University Of Patras]]></category>
		<category domain="http://updates.zdnet.com/tags/network+technology.html"><![CDATA[Network Technology]]></category>
		<category domain="http://updates.zdnet.com/tags/engineering.html"><![CDATA[Engineering]]></category>
		<category domain="http://updates.zdnet.com/tags/networking.html"><![CDATA[Networking]]></category>
	</item>
	<item>
		<title><![CDATA[Combinatorics of TCP Reordering]]></title>
		<link><![CDATA[http://whitepapers.zdnet.com/abstract.aspx?docid=333384]]></link>
		<description><![CDATA[This paper studies a combinatorial problem motivated by a receiver-oriented model of TCP traffic from, that incorporates information on both arrival times, and the dynamics of packet IDs. It shows that given a buffer sequence B, constructing a sequence A of IDs that belongs to the preimage of B is...]]></description>
		<s:doctype><![CDATA[White papers]]></s:doctype>
		<pubDate>Tue, 10 Apr 2007 00:00:00 -0700</pubDate>
		<category domain="http://updates.zdnet.com/tags/pennsylvania+state+university.html"><![CDATA[Pennsylvania State University]]></category>
		<category domain="http://updates.zdnet.com/tags/packet.html"><![CDATA[Packet]]></category>
		<category domain="http://updates.zdnet.com/tags/tcp.html"><![CDATA[TCP]]></category>
		<category domain="http://updates.zdnet.com/tags/bound.html"><![CDATA[Bound]]></category>
		<category domain="http://updates.zdnet.com/tags/tcp%252fip.html"><![CDATA[Tcp/Ip]]></category>
		<category domain="http://updates.zdnet.com/tags/networking.html"><![CDATA[Networking]]></category>
	</item>
	<item>
		<title><![CDATA[Efficiency Centric Communication Model for Wireless Sensor Networks]]></title>
		<link><![CDATA[http://whitepapers.zdnet.com/abstract.aspx?docid=310267]]></link>
		<description><![CDATA[Recent studies on radio reality provided strong evidence that radio links between low-power sensor devices are extremely unreliable. This paper studies how to improve energy efficiency for reliable communication using such unreliable links. The paper identifies an optimal bound on energy efficiency for reliable communication, and proposes a new communication...]]></description>
		<s:doctype><![CDATA[White papers]]></s:doctype>
		<pubDate>Sat, 07 Jan 2006 00:00:00 -0800</pubDate>
		<category domain="http://updates.zdnet.com/tags/energy+efficiency.html"><![CDATA[Energy Efficiency]]></category>
		<category domain="http://updates.zdnet.com/tags/university+of+virginia.html"><![CDATA[University Of Virginia]]></category>
		<category domain="http://updates.zdnet.com/tags/network.html"><![CDATA[Network]]></category>
		<category domain="http://updates.zdnet.com/tags/communication.html"><![CDATA[Communication]]></category>
		<category domain="http://updates.zdnet.com/tags/wireless+sensor+network.html"><![CDATA[Wireless Sensor Network]]></category>
		<category domain="http://updates.zdnet.com/tags/radio.html"><![CDATA[Radio]]></category>
		<category domain="http://updates.zdnet.com/tags/bound.html"><![CDATA[Bound]]></category>
		<category domain="http://updates.zdnet.com/tags/wireless.html"><![CDATA[Wireless]]></category>
		<category domain="http://updates.zdnet.com/tags/advertising+%2526+promotion.html"><![CDATA[Advertising & Promotion]]></category>
		<category domain="http://updates.zdnet.com/tags/marketing.html"><![CDATA[Marketing]]></category>
	</item>
</channel>
</rss>
