Sciweavers

    10608 search results - page 125 / 2122
    » Complexity of O'Hara's Algorithm
    Sort
    View
    DAGSTUHL
    2004
    105views Software Engineering» more  DAGSTUHL 2004»
    On the Complexity of Parabolic Initial Value Problems with Variable Drift
    13 years 11 months ago
    On the Complexity of Parabolic Initial Value Problems with Variable Drift
    Download  drops.dagstuhl.de
    We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
    Knut Petras, Klaus Ritter
    claim paper
    Read More »
    IJFCS
    2006
    70views more  IJFCS 2006»
    The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
    13 years 10 months ago
    The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
    Download  theinf1.informatik.uni-jena.de
    We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
    Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
    claim paper
    Read More »
    CORR
    2002
    Springer
    102views Education» more  CORR 2002»
    Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classificatio
    13 years 10 months ago
    Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classificatio
    Download  cogprints.org
    The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
    Peter D. Turney
    claim paper
    Read More »
    ALDT
    2011
    Springer
    262views Algorithms» more  ALDT 2011»
    Learning Complex Concepts Using Crowdsourcing: A Bayesian Approach
    12 years 10 months ago
    Learning Complex Concepts Using Crowdsourcing: A Bayesian Approach
    Download  www.cs.toronto.edu
    Abstract. We develop a Bayesian approach to concept learning for crowdsourcing applications. A probabilistic belief over possible concept definitions is maintained and updated acc...
    Paolo Viappiani, Sandra Zilles, Howard J. Hamilton...
    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 5 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 »
    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.