Sciweavers

    9949 search results - page 182 / 1990
    » On the Network Complexity of Selection
    Sort
    View
    68
    Voted
    IJSYSC
    2011
    60views more  IJSYSC 2011»
    On necessary conditions for scale-freedom in complex networks, with applications to computer communication systems
    14 years 11 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 11 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 »
    123
    Voted
    INFOCOM
    2012
    IEEE
    180views Communications» more  INFOCOM 2012»
    Analyzing collaboration networks using simplicial complexes: A case study
    13 years 7 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 »
    PODS
    2005
    ACM
    118views Database» more  PODS 2005»
    On the complexity of division and set joins in the relational algebra
    16 years 4 months ago
    On the complexity of division and set joins in the relational algebra
    Download  alpha.uhasselt.be
    We show that any expression of the relational division operator in the relational algebra with union, difference, projection, selection, constant-tagging, and joins, must produce ...
    Dirk Leinders, Jan Van den Bussche
    claim paper
    Read More »
    NIPS
    2004
    152views Information Technology» more  NIPS 2004»
    Breaking SVM Complexity with Cross-Training
    15 years 6 months ago
    Breaking SVM Complexity with Cross-Training
    Download  books.nips.cc
    We propose to selectively remove examples from the training set using probabilistic estimates related to editing algorithms (Devijver and Kittler, 1982). This heuristic procedure ...
    Gökhan H. Bakir, Léon Bottou, Jason We...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.