Sciweavers

    4860 search results - page 9 / 972
    » SNPs Problems, Complexity, and Algorithms
    Sort
    View
    IWOCA
    2009
    Springer
    112views Algorithms» more  IWOCA 2009»
    The Guarding Problem - Complexity and Approximation
    14 years 1 days ago
    The Guarding Problem - Complexity and Approximation
    Download  www.cse.iitm.ac.in
    T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
    claim paper
    Read More »
    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 »
    LATA
    2012
    Springer
    296views Artificial Intelligence» more  LATA 2012»
    On the Parameterized Complexity of Default Logic and Autoepistemic Logic
    12 years 3 months ago
    On the Parameterized Complexity of Default Logic and Autoepistemic Logic
    Download  www.thi.uni-hannover.de
    We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...
    Arne Meier, Johannes Schmidt, Michael Thomas, Heri...
    claim paper
    Read More »
    SIGAL
    1990
    221views Algorithms» more  SIGAL 1990»
    Complexity Cores and Hard Problem Instances
    13 years 11 months ago
    Complexity Cores and Hard Problem Instances
    Download  www.uni-ulm.de
    Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard sub...
    Uwe Schöning
    claim paper
    Read More »
    SSWMC
    2004
    156views Security Privacy» more  SSWMC 2004»
    On the complexity and hardness of the steganography embedding problem
    13 years 8 months ago
    On the complexity and hardness of the steganography embedding problem
    Download  www.ece.stevens-tech.edu
    We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
    Rajarathnam Chandramouli, Shalin P. Trivedi, R. N....
    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.