Sciweavers

    5114 search results - page 54 / 1023
    » Complex networks
    Sort
    View
    IJSYSC
    2011
    60views more  IJSYSC 2011»
    On necessary conditions for scale-freedom in complex networks, with applications to computer communication systems
    14 years 6 months ago
    On necessary conditions for scale-freedom in complex networks, with applications to computer communication systems
    Download  www.ece.ucsb.edu
    Wenjun Xiao, Weidong Chen, Behrooz Parhami
    claim paper
    Read More »
    JAMDS
    2010
    59views more  JAMDS 2010»
    Input and Output Passivity of Complex Dynamical Networks with General Topology
    14 years 6 months ago
    Input and Output Passivity of Complex Dynamical Networks with General Topology
    Download  www.maths.soton.ac.uk
    Jinliang Wang
    claim paper
    Read More »
    INFOCOM
    2012
    IEEE
    180views Communications» more  INFOCOM 2012»
    Analyzing collaboration networks using simplicial complexes: A case study
    13 years 2 months ago
    Analyzing collaboration networks using simplicial complexes: A case study
    Download  www.ir.bbn.com
    Terrence J. Moore, Robert J. Drost, Prithwish Basu...
    claim paper
    Read More »
    BMCBI
    2008
    131views more  BMCBI 2008»
    Modifying the DPClus algorithm for identifying protein complexes based on new topological structures
    14 years 12 months ago
    Modifying the DPClus algorithm for identifying protein complexes based on new topological structures
    Download  www.biomedcentral.com
    Background: Identification of protein complexes is crucial for understanding principles of cellular organization and functions. As the size of protein-protein interaction set incr...
    Min Li, Jianer Chen, Jianxin Wang, Bin Hu, Gang Ch...
    claim paper
    Read More »
    TON
    2008
    99views more  TON 2008»
    On the computational complexity and effectiveness of N-hub shortest-path routing
    14 years 11 months ago
    On the computational complexity and effectiveness of N-hub shortest-path routing
    Download  www.ieee-infocom.org
    Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
    Reuven Cohen, Gabi Nakibly
    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.