Sciweavers

    29908 search results - page 63 / 5982
    » On the Complexity of
    Sort
    View
    AAAI
    2007
    84views Intelligent Agents» more  AAAI 2007»
    Complexity Boundaries for Horn Description Logics
    14 years 12 days ago
    Complexity Boundaries for Horn Description Logics
    Download  people.aifb.kit.edu
    Horn description logics (Horn-DLs) have recently started to attract attention due to the fact that their (worst-case) data complexities are in general lower than their overall (i....
    Markus Krötzsch, Sebastian Rudolph, Pascal Hi...
    claim paper
    Read More »
    CCIA
    2008
    Springer
    135views Artificial Intelligence» more  CCIA 2008»
    On the Dimensions of Data Complexity through Synthetic Data Sets
    14 years 2 days ago
    On the Dimensions of Data Complexity through Synthetic Data Sets
    Download  www.salle.url.edu
    Abstract. This paper deals with the characterization of data complexity and the relationship with the classification accuracy. We study three dimensions of data complexity: the len...
    Núria Macià, Ester Bernadó-Ma...
    claim paper
    Read More »
    NIPS
    2008
    89views Information Technology» more  NIPS 2008»
    Rademacher Complexity Bounds for Non-I.I.D. Processes
    13 years 11 months ago
    Rademacher Complexity Bounds for Non-I.I.D. Processes
    Download  www.cs.nyu.edu
    This paper presents the first Rademacher complexity-based error bounds for noni.i.d. settings, a generalization of similar existing bounds derived for the i.i.d. case. Our bounds ...
    Mehryar Mohri, Afshin Rostamizadeh
    claim paper
    Read More »
    WICON
    2008
    150views Computer Networks» more  WICON 2008»
    On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
    13 years 11 months ago
    On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
    Download  udelmodels.eecis.udel.edu
    It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
    Peng Wang, Stephan Bohacek
    claim paper
    Read More »
    DAGSTUHL
    2006
    154views Software Engineering» more  DAGSTUHL 2006»
    The complexity of Boolean functions from cryptographic viewpoint
    13 years 11 months ago
    The complexity of Boolean functions from cryptographic viewpoint
    Download  drops.dagstuhl.de
    Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...
    Claude Carlet
    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.