Sciweavers

    1972 search results - page 388 / 395
    » connection 2008
    Sort
    View
    ESORICS
    2008
    Springer
    157views Security Privacy» more  ESORICS 2008»
    Symmetric Key Approaches to Securing BGP - A Little Bit Trust Is Enough
    13 years 8 months ago
    Symmetric Key Approaches to Securing BGP - A Little Bit Trust Is Enough
    Download  www.cse.msu.edu
    The Border Gateway Protocol (BGP) is the de facto inter-domain routing protocol that connects autonomous systems (ASes). Despite its importance for the Internet infrastructure, BGP...
    Bezawada Bruhadeshwar, Sandeep S. Kulkarni, Alex X...
    claim paper
    Read More »
    ATMOS
    2008
    103views Optimization» more  ATMOS 2008»
    IP-based Techniques for Delay Management with Priority Decisions
    13 years 8 months ago
    IP-based Techniques for Delay Management with Priority Decisions
    Download  drops.dagstuhl.de
    Delay management is an important issue in the daily operations of any railway company. The task is to update the planned timetable to a disposition timetable in such a way that the...
    Michael Schachtebeck, Anita Schöbel
    claim paper
    Read More »
    FMSB
    2008
    142views Formal Methods» more  FMSB 2008»
    Generic Reactive Animation: Realistic Modeling of Complex Natural Systems
    13 years 8 months ago
    Generic Reactive Animation: Realistic Modeling of Complex Natural Systems
    Download  www.wisdom.weizmann.ac.il
    Abstract. Natural systems, such as organs and organisms, are largescale complex systems with numerous elements and interactions. Modeling such systems can lead to better understand...
    David Harel, Yaki Setty
    claim paper
    Read More »
    SODA
    2008
    ACM
    104views Algorithms» more  SODA 2008»
    Ranged hash functions and the price of churn
    13 years 8 months ago
    Ranged hash functions and the price of churn
    Download  www.cs.yale.edu
    Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
    James Aspnes, Muli Safra, Yitong Yin
    claim paper
    Read More »
    SODA
    2008
    ACM
    100views Algorithms» more  SODA 2008»
    A tight lower bound for parity in noisy communication networks
    13 years 8 months ago
    A tight lower bound for parity in noisy communication networks
    Download  www.tcs.tifr.res.in
    We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
    Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.