<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0" xmlns:s="http://www.techrepublic.com/search" xmlns:dc="http://purl.org/dc/elements/1.1/"  xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
    <title><![CDATA[Research Library - White Papers, Webcasts and Case Studies - TechRepublic ]]></title>
    <link><![CDATA[http://www.techrepublic.com/research-library]]></link>
    <atom:link rel="hub" type="application/rss+xml" href="http://pubsubhubbub.appspot.com/" />
    <atom:link rel="self" type="application/rss+xml" href="http://www.techrepublic.com/research-library/technion+-+israel+institute+of+technology?mode=rss" />

    <description><![CDATA[]]></description>
    <s:counts start="" returned="" found="" />
    <language>en-us</language>
    <lastBuildDate>2013-05-21T23:06:03-07:00</lastBuildDate>
            <item>
        <title><![CDATA[Capacity of Multiple Access Channel With States Known Noncausally at One Encoder and Only Strictly Causally at the Other Encoder]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/capacity-of-multiple-access-channel-with-states-known-noncausally-at-one-encoder-and-only-strictly-causally-at-the-other-encoder/32775313]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[The capacity of a two-user state-dependent multiple access channel with common message and states known non-causally at only one encoder is established in, for both Discrete Memoryless (DM) and...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/capacity-of-multiple-access-channel-with-states-known-noncausally-at-one-encoder-and-only-strictly-causally-at-the-other-encoder/32775313]]></guid>
        <pubDate>Sat, 19 Jan 2013 01:25:49 -0800</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Multiple Access Channel With States Known Noncausally at One Encoder and Only Strictly Causally at the Other Encoder]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/multiple-access-channel-with-states-known-noncausally-at-one-encoder-and-only-strictly-causally-at-the-other-encoder/32775311]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[The authors consider a two-user state-dependent multi-access channel in which the states of the channel are known non-causally to one of the encoders and only strictly causally to the other...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/multiple-access-channel-with-states-known-noncausally-at-one-encoder-and-only-strictly-causally-at-the-other-encoder/32775311]]></guid>
        <pubDate>Sat, 19 Jan 2013 01:24:46 -0800</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Wyner-Ziv Type Versus Noisy Network Coding for a State-Dependent MAC]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/wyner-ziv-type-versus-noisy-network-coding-for-a-state-dependent-mac/32775309]]></link>
        <s:doctype><![CDATA[Whitepapers]]></s:doctype>
        <description><![CDATA[The authors consider a two-user state-dependent multi-access channel in which the states of the channel are known non-causally to one of the encoders and only strictly causally to the other...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/wyner-ziv-type-versus-noisy-network-coding-for-a-state-dependent-mac/32775309]]></guid>
        <pubDate>Sat, 19 Jan 2013 01:23:43 -0800</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Programmable Protocols for Social Networks]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/programmable-protocols-for-social-networks/4276061]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[The authors study automation in social networks using protocols. They introduce a generic social protocol which addresses the basic problem of making a determination of status regarding an entity...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/programmable-protocols-for-social-networks/4276061]]></guid>
        <pubDate>Thu, 10 May 2012 08:55:31 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[On the Admission of Dependent Flows in Powerful Sensor Networks]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/on-the-admission-of-dependent-flows-in-powerful-sensor-networks/3975769]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[In this paper, the authors define and study a new problem, referred to as the Dependent Unsplittable Flow Problem (D-UFP). They present and discuss this problem in the context of large-scale...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/on-the-admission-of-dependent-flows-in-powerful-sensor-networks/3975769]]></guid>
        <pubDate>Tue, 14 Feb 2012 08:34:55 -0800</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Efficient Location-Based Decision Supporting Content Distribution to Mobile Groups]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/efficient-location-based-decision-supporting-content-distribution-to-mobile-groups/3975765]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[The paper deals with efficient location-based decision supporting content distribution to mobile groups. The authors consider the case where a set of Information Dissemination Devices (IDDs)...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/efficient-location-based-decision-supporting-content-distribution-to-mobile-groups/3975765]]></guid>
        <pubDate>Tue, 14 Feb 2012 08:32:52 -0800</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Minimal Cost Reconfiguration of Data Placement in Storage Area Network]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/minimal-cost-reconfiguration-of-data-placement-in-storage-area-network/3801631]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[Video-on-Demand (VoD) services require frequent updates in file configuration on the storage subsystem, so as to keep up with the frequent changes in movie popularity. This defines a natural...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/minimal-cost-reconfiguration-of-data-placement-in-storage-area-network/3801631]]></guid>
        <pubDate>Fri, 13 Jan 2012 07:34:31 -0800</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[A Multipath Routing Algorithm for Mobile Wireless Sensor Networks]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/a-multipath-routing-algorithm-for-mobile-wireless-sensor-networks/3756643]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[Providing reliable and yet energy efficient routing protocols is of an utmost importance in Wireless Sensor Networks. Wireless Sensor Networks imply multi-hop data forwarding over unreliable and...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/a-multipath-routing-algorithm-for-mobile-wireless-sensor-networks/3756643]]></guid>
        <pubDate>Fri, 02 Dec 2011 07:50:17 -0800</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[On the Computational Complexity and Effectiveness of N-Hub Shortest-Path Routing]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/on-the-computational-complexity-and-effectiveness-of-n-hub-shortest-path-routing/3662511]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[In this paper, the authors study the computational complexity and effectiveness of a concept they term &quot;N-hub Shortest-Path Routing&quot; in IP networks. N-hub Shortest-Path Routing allows the ingress...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/on-the-computational-complexity-and-effectiveness-of-n-hub-shortest-path-routing/3662511]]></guid>
        <pubDate>Mon, 24 Oct 2011 05:48:03 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[An Optimal Wake-Up Scheduling Algorithm for Minimizing Energy Consumption While Limiting Maximum Delay in a Mesh Sensor Network]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/an-optimal-wake-up-scheduling-algorithm-for-minimizing-energy-consumption-while-limiting-maximum-delay-in-a-mesh-sensor-network/3662509]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[This paper presents an algorithm for maximizing the lifetime of a sensor network while guaranteeing an upper bound on the end-to-end delay. The authors prove that the proposed algorithm is...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/an-optimal-wake-up-scheduling-algorithm-for-minimizing-energy-consumption-while-limiting-maximum-delay-in-a-mesh-sensor-network/3662509]]></guid>
        <pubDate>Mon, 24 Oct 2011 05:47:02 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Continuous Neighbor Discovery in Asynchronous Sensor Networks]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/continuous-neighbor-discovery-in-asynchronous-sensor-networks/3662507]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[In most sensor networks the nodes are static. Nevertheless, node connectivity is subject to changes because of disruptions in wireless communication, transmission power changes, or loss of...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/continuous-neighbor-discovery-in-asynchronous-sensor-networks/3662507]]></guid>
        <pubDate>Mon, 24 Oct 2011 05:46:00 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Computational Analysis and Efficient Algorithms for Micro and Macro OFDMA Downlink Scheduling]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/computational-analysis-and-efficient-algorithms-for-micro-and-macro-ofdma-downlink-scheduling/3662505]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[OFDMA is one of the most important modulation and access methods for the future mobile networks. Before transmitting a frame on the downlink, an OFDMA base station has to invoke an algorithm that...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/computational-analysis-and-efficient-algorithms-for-micro-and-macro-ofdma-downlink-scheduling/3662505]]></guid>
        <pubDate>Mon, 24 Oct 2011 05:44:59 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[A Generic Scheme for Estimating the Size of a Group While Avoiding Feedback Implosion]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/a-generic-scheme-for-estimating-the-size-of-a-group-while-avoiding-feedback-implosion/3662503]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[The authors present a probabilistic polling scheme for estimating the size of a group of nodes affected by the same event. They analyze the bias of the proposed scheme and show how it can be...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/a-generic-scheme-for-estimating-the-size-of-a-group-while-avoiding-feedback-implosion/3662503]]></guid>
        <pubDate>Mon, 24 Oct 2011 05:43:57 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Locally Vs. Globally Optimized Flow-Based Content Distribution to Mobile Groups]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/locally-vs-globally-optimized-flow-based-content-distribution-to-mobile-groups/3662501]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[The paper deals with efficient distribution of timely information to mobile groups. The authors consider the case where a set of Information Dissemination Devices (IDDs) broadcast a limited amount...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/locally-vs-globally-optimized-flow-based-content-distribution-to-mobile-groups/3662501]]></guid>
        <pubDate>Mon, 24 Oct 2011 05:42:56 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Maximizing Restorable Throughput in MPLS NetworksLS Networks]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/maximizing-restorable-throughput-in-mpls-networksls-networks/3638453]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths are established in...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/maximizing-restorable-throughput-in-mpls-networksls-networks/3638453]]></guid>
        <pubDate>Fri, 21 Oct 2011 07:55:07 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[A Route-Control Mechanism for Improving the Performance of Transport Protocols in a MANET]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/a-route-control-mechanism-for-improving-the-performance-of-transport-protocols-in-a-manet/3638451]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[The authors propose a new cross-layer mechanism, referred to as Route-control, for Mobile Ad-hoc NETworks (MANETs). This mechanism, which works in the Network and Transport layers, aims at...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/a-route-control-mechanism-for-improving-the-performance-of-transport-protocols-in-a-manet/3638451]]></guid>
        <pubDate>Fri, 21 Oct 2011 07:54:06 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[A Scalable Scheme for Preventing Feedback Implosion in a Large-Scale Multi-Tier Sensor Network]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/a-scalable-scheme-for-preventing-feedback-implosion-in-a-large-scale-multi-tier-sensor-network/3638449]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[The authors consider a huge hierarchical sensor network consisting of millions of sensors arranged in clusters for scalability and cost-performance. They address the problem of how a centralized...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/a-scalable-scheme-for-preventing-feedback-implosion-in-a-large-scale-multi-tier-sensor-network/3638449]]></guid>
        <pubDate>Fri, 21 Oct 2011 07:53:04 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Efficient Allocation of CQI Channels in Broadband Wireless Networks]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/efficient-allocation-of-cqi-channels-in-broadband-wireless-networks/3638447]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[In an OFDMA network, the Modulation and Coding Scheme (MCS) of the messages sent to the Mobile Stations (MSs) varies according to channel condition. To determine the appropriate MCS level, the...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/efficient-allocation-of-cqi-channels-in-broadband-wireless-networks/3638447]]></guid>
        <pubDate>Fri, 21 Oct 2011 07:52:02 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Energy-Delay Optimization in an Asynchronous Sensor Network With Multiple Gateways]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/energy-delay-optimization-in-an-asynchronous-sensor-network-with-multiple-gateways/3638445]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[This paper studies the problem of energy efficient routing in a sensor network with multiple gateways. Due to the complexity of this problem, the authors divide it into two sub-problems: the...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/energy-delay-optimization-in-an-asynchronous-sensor-network-with-multiple-gateways/3638445]]></guid>
        <pubDate>Fri, 21 Oct 2011 07:51:00 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[On Reliable Dissemination in Wireless Ad-Hoc Networks]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/on-reliable-dissemination-in-wireless-ad-hoc-networks/3338975]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[Reliable broadcast is a basic service for many collaborative applications as it provides reliable dissemination of the same information to many recipients. This paper studies three common...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/on-reliable-dissemination-in-wireless-ad-hoc-networks/3338975]]></guid>
        <pubDate>Mon, 22 Aug 2011 07:37:37 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[SMV: Selective Multi-Versioning STM]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/smv-selective-multi-versioning-stm/2954837]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[The authors present Selective Multi-Versioning (SMV), a new STM that reduces the number of aborts, especially those of long read-only transactions. SMV keeps old object versions as long as they...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/smv-selective-multi-versioning-stm/2954837]]></guid>
        <pubDate>Fri, 01 Jul 2011 10:18:41 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Reliable Architecture for Flash Memory]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/reliable-architecture-for-flash-memory/2954835]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[The mounting demand for high density non-volatile flash memories consequences new challenges of flash memory reliability issues [1, 2]. Common reliability-improving techniques approaches are...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/reliable-architecture-for-flash-memory/2954835]]></guid>
        <pubDate>Fri, 01 Jul 2011 10:17:39 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Packet-Level Static Timing Analysis for NoCs]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/packet-level-static-timing-analysis-for-nocs/2954833]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[Networks-on-Chip (NoCs) are used in a growing number of SoCs and multi-core processors, increasing the need for accurate and efficient modeling to aid the design of integrated systems. A...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/packet-level-static-timing-analysis-for-nocs/2954833]]></guid>
        <pubDate>Fri, 01 Jul 2011 10:16:38 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Low-Overhead Error Detection for Networks-on-Chip]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/low-overhead-error-detection-for-networks-on-chip/2954831]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[In the current deep sub-micron age, interconnect reliability is a subject of major concern, and is crucial for a successful product. Coding is a widely-used method to achieve communication...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/low-overhead-error-detection-for-networks-on-chip/2954831]]></guid>
        <pubDate>Fri, 01 Jul 2011 10:15:37 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Link Division Multiplexing (LDM) for Network-on-Chip Links]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/link-division-multiplexing-ldm-for-network-on-chip-links/2954811]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[Large Systems-on-Chip (SoC) can employ packet-switched Networks on-Chip with Quality-of-Service (QNoC) architecture. Communication in QNoC links typically involves Time Division Multiplexing...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/link-division-multiplexing-ldm-for-network-on-chip-links/2954811]]></guid>
        <pubDate>Fri, 01 Jul 2011 10:05:23 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[BENoC: A Bus-Enhanced Network on-Chip]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/benoc-a-bus-enhanced-network-on-chip/2954801]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[Recent research has shown that Network on-Chip (NoC) is superior to a bus in terms of power and area for given traffic throughput requirements. Consequently, NoC is expected to be the main...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/benoc-a-bus-enhanced-network-on-chip/2954801]]></guid>
        <pubDate>Fri, 01 Jul 2011 10:00:16 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Best of Both Worlds: A Bus Enhanced NoC (BENoC)]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/best-of-both-worlds-a-bus-enhanced-noc-benoc/2954799]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[While NoCs are efficient in delivering high throughput point-to-point traffic, their multi-hop operation is too slow for latency sensitive signals. In addition, NoCS are inefficient for multicast...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/best-of-both-worlds-a-bus-enhanced-noc-benoc/2954799]]></guid>
        <pubDate>Fri, 01 Jul 2011 09:59:15 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[The Space Complexity of Processing XML Twig Queries Over Indexed Documents]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/the-space-complexity-of-processing-xml-twig-queries-over-indexed-documents/2361441]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. This paper provides an analytical explanation for this phenomenon. In a first large-scale study of...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/the-space-complexity-of-processing-xml-twig-queries-over-indexed-documents/2361441]]></guid>
        <pubDate>Tue, 14 Dec 2010 08:30:53 -0800</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Poster Abstract: AQoS WMN With Mobility Support]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/poster-abstract-aqos-wmn-with-mobility-support/2335317]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[This paper present QMesh, a software package that allows utilizing multiple geographically scattered Windows desktops as a wireless mesh network infrastructure with seamless user mobility support....]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/poster-abstract-aqos-wmn-with-mobility-support/2335317]]></guid>
        <pubDate>Fri, 19 Nov 2010 10:00:29 -0800</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
            <item>
        <title><![CDATA[Exposing and Eliminating Vulnerabilities to Denial of Service Attacks in Secure Gossip-Based Multicast]]></title>
        <link><![CDATA[http://www.techrepublic.com/whitepapers/exposing-and-eliminating-vulnerabilities-to-denial-of-service-attacks-in-secure-gossip-based-multicast/1014707]]></link>
        <s:doctype><![CDATA[White Papers]]></s:doctype>
        <description><![CDATA[This paper proposes a framework and methodology for quantifying the effect of Denial of Service (DoS) attacks on a distributed system. They present a systematic study of the resistance of...]]></description>
        <guid><![CDATA[http://www.techrepublic.com/whitepapers/exposing-and-eliminating-vulnerabilities-to-denial-of-service-attacks-in-secure-gossip-based-multicast/1014707]]></guid>
        <pubDate>Fri, 19 Jun 2009 08:51:34 -0700</pubDate>
        <enclosure url="" type="image/jpeg" />
        
    </item>
    </channel>
</rss>

