Sciweavers

    309 search results - page 24 / 62
    » Fault Tolerance of Embryonic Algorithms in Mobile Networks
    Sort
    View
    97
    Voted
    CCS
    2007
    ACM
    112views Security Privacy» more  CCS 2007»
    Robust group key agreement using short broadcasts
    15 years 3 months ago
    Robust group key agreement using short broadcasts
    Download  www.ics.uci.edu
    A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
    Stanislaw Jarecki, Jihye Kim, Gene Tsudik
    claim paper
    Read More »
    87
    Voted
    FSTTCS
    2009
    Springer
    143views Software Engineering» more  FSTTCS 2009»
    Approximating Fault-Tolerant Group-Steiner Problems
    15 years 4 months ago
    Approximating Fault-Tolerant Group-Steiner Problems
    Download  crab.rutgers.edu
    In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
    Rohit Khandekar, Guy Kortsarz, Zeev Nutov
    claim paper
    Read More »
    ISPAN
    2005
    IEEE
    126views Distributed And Parallel Com...» more  ISPAN 2005»
    Coordinated Robust Routing by Dual Cluster Heads in Layered Wireless Sensor Networks
    15 years 3 months ago
    Coordinated Robust Routing by Dual Cluster Heads in Layered Wireless Sensor Networks
    Download  www.ee.unlv.edu
    In this paper, we propose the coordinated robust routing (CRR) scheme to address the fault tolerance requirements in the layered wireless sensor networks. In the proposed scheme, ...
    Mei Yang, Jianping Wang, Zhen-guo Gao, Yingtao Jia...
    claim paper
    Read More »
    NSDI
    2007
    137views Computer Networks» more  NSDI 2007»
    Beyond One-Third Faulty Replicas in Byzantine Fault Tolerant Systems
    15 years 19 min ago
    Beyond One-Third Faulty Replicas in Byzantine Fault Tolerant Systems
    Download  www.scs.stanford.edu
    Byzantine fault tolerant systems behave correctly when no more than f out of 3f + 1 replicas fail. When there are more than f failures, traditional BFT protocols make no guarantee...
    Jinyuan Li, David Mazières
    claim paper
    Read More »
    ISCAPDCS
    2007
    117views Distributed And Parallel Com...» more  ISCAPDCS 2007»
    A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
    14 years 11 months ago
    A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
    Download  cis.k.hosei.ac.jp
    With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
    Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
    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-2025, USA.