Sciweavers

    9842 search results - page 82 / 1969
    » The Complexity of the Matching-Cut Problem
    Sort
    View
    EMNLP
    2008
    94views Natural Language Processing» more  EMNLP 2008»
    Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
    13 years 9 months ago
    Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
    Download  www.aclweb.org
    Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
    Gregor Leusch, Evgeny Matusov, Hermann Ney
    claim paper
    Read More »
    ISTA
    2007
    136views Information Technology» more  ISTA 2007»
    Knowledge-Oriented Approach to the Main Pipeline Complex Dispatching Control
    13 years 9 months ago
    Knowledge-Oriented Approach to the Main Pipeline Complex Dispatching Control
    Download  subs.emis.de
    : The article is devoted to the development of knowledge-oriented models that are able to increase the efficiency and quality of main pipeline complex (MPC) dispatching control. Th...
    O. Ye. Fedorovich, A. V. Prokhorov, K. V. Golovan
    claim paper
    Read More »
    ESANN
    2003
    124views Neural Networks» more  ESANN 2003»
    Neural networks organizations to learn complex robotic functions
    13 years 9 months ago
    Neural networks organizations to learn complex robotic functions
    Download  www.dice.ucl.ac.be
    Abstract. This paper considers the general problem of function estimation with a modular approach of neural computing. We propose to use functionally independent subnetworks to lea...
    Gilles Hermann, Patrice Wira, Jean-Philippe Urban
    claim paper
    Read More »
    WSC
    1997
    122views Modeling And Simulation» more  WSC 1997»
    The Four Phase Method for Modelling Complex Systems
    13 years 9 months ago
    The Four Phase Method for Modelling Complex Systems
    Download  www.informs-sim.org
    This paper investigates an attempt to combine different simulation tools in order to build a simulation environment that can be used to model complex system behaviour. The compone...
    Hamad I. Odhabi, Ray J. Paul, Robert D. Macredie
    claim paper
    Read More »
    IANDC
    2010
    67views more  IANDC 2010»
    Parameterized computational complexity of Dodgson and Young elections
    13 years 6 months ago
    Parameterized computational complexity of Dodgson and Young elections
    Download  theinf1.informatik.uni-jena.de
    We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
    Nadja Betzler, Jiong Guo, Rolf Niedermeier
    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.