Sciweavers

    219 search results - page 23 / 44
    » Multiple Alignment of Biological Networks: A Flexible Approa...
    Sort
    View
    BMCBI
    2011
    252views Artificial Intelligence» more  BMCBI 2011»
    A hierarchical Bayesian network approach for linkage disequilibrium modeling and data-dimensionality reduction prior to genome-w
    12 years 11 months ago
    A hierarchical Bayesian network approach for linkage disequilibrium modeling and data-dimensionality reduction prior to genome-w
    Download  www.biomedcentral.com
    Background: Discovering the genetic basis of common genetic diseases in the human genome represents a public health issue. However, the dimensionality of the genetic data (up to 1...
    Raphael Mourad, Christine Sinoquet, Philippe Leray
    claim paper
    Read More »
    MOBISYS
    2005
    ACM
    111views Computer Networks» more  MOBISYS 2005»
    Horde: separating network striping policy from mechanism
    14 years 7 months ago
    Horde: separating network striping policy from mechanism
    Download  nms.lcs.mit.edu
    Inverse multiplexing, or network striping, allows the construction of a high-bandwidth virtual channel from a collection of multiple low-bandwidth network channels. Striping syste...
    Asfandyar Qureshi, John V. Guttag
    claim paper
    Read More »
    BMCBI
    2006
    148views more  BMCBI 2006»
    Predicting Class II MHC-Peptide binding: a kernel based approach using similarity scores
    13 years 7 months ago
    Predicting Class II MHC-Peptide binding: a kernel based approach using similarity scores
    Download  www.biomedcentral.com
    Background: Modelling the interaction between potentially antigenic peptides and Major Histocompatibility Complex (MHC) molecules is a key step in identifying potential T-cell epi...
    Jesper Salomon, Darren R. Flower
    claim paper
    Read More »
    SODA
    1998
    ACM
    157views Algorithms» more  SODA 1998»
    A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
    13 years 9 months ago
    A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
    Download  www.csie.ntu.edu.tw
    Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
    Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
    claim paper
    Read More »
    EVOW
    2008
    Springer
    173views Artificial Intelligence» more  EVOW 2008»
    Composing Music with Neural Networks and Probabilistic Finite-State Machines
    13 years 9 months ago
    Composing Music with Neural Networks and Probabilistic Finite-State Machines
    Download  www.uni-koblenz.de
    In this paper, biological (human) music composition systems based on Time Delay Neural Networks and Ward Nets and on a probabilistic Finite-State Machine will be presented. The sys...
    Tomasz Michal Oliwa, Markus Wagner
    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.