Sciweavers

    4860 search results - page 37 / 972
    » SNPs Problems, Complexity, and Algorithms
    Sort
    View
    FLAIRS
    2003
    100views Artificial Intelligence» more  FLAIRS 2003»
    Sample Complexity of Real-Coded Evolutionary Algorithms
    13 years 9 months ago
    Sample Complexity of Real-Coded Evolutionary Algorithms
    Download  www.aaai.org
    Researchers studying Evolutionary Algorithms and their applications have always been confronted with the sample complexity problem. The relationship between population size and gl...
    Jian Zhang 0007, Xiaohui Yuan, Bill P. Buckles
    claim paper
    Read More »
    EOR
    2008
    136views more  EOR 2008»
    Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
    13 years 7 months ago
    Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
    Download  theinf1.informatik.uni-jena.de
    Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
    Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...
    claim paper
    Read More »
    ICIP
    1998
    IEEE
    105views Image Processing» more  ICIP 1998»
    Reducing the Computational Complexity of a Map Post-Processing Algorithm for Video Sequences
    14 years 9 months ago
    Reducing the Computational Complexity of a Map Post-Processing Algorithm for Video Sequences
    Download  reference.kfupm.edu.sa
    Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
    Mark A. Robertson, Robert L. Stevenson
    claim paper
    Read More »
    ICGI
    2010
    Springer
    119views Natural Language Processing» more  ICGI 2010»
    Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us
    13 years 6 months ago
    Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us
    Download  ilk.uvt.nl
    Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
    Sophia Katrenko, Menno van Zaanen
    claim paper
    Read More »
    STOC
    2009
    ACM
    167views Algorithms» more  STOC 2009»
    On the complexity of communication complexity
    14 years 8 months ago
    On the complexity of communication complexity
    Download  www.cs.bgu.ac.il
    We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
    Eyal Kushilevitz, Enav Weinreb
    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.