Sciweavers

    1149 search results - page 209 / 230
    » Minimally non-Pfaffian graphs
    Sort
    View
    EMNLP
    2008
    94views Natural Language Processing» more  EMNLP 2008»
    Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
    13 years 8 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 »
    SCAI
    2008
    212views Artificial Intelligence» more  SCAI 2008»
    Troubleshooting when Action Costs are Dependent with Application to a Truck Engine
    13 years 8 months ago
    Troubleshooting when Action Costs are Dependent with Application to a Truck Engine
    Download  www.ida.liu.se
    We propose a troubleshooting algorithm that can troubleshoot systems with dependent action costs. When actions are performed they may change the way the system is decomposed and af...
    Håkan Warnquist, Mattias Nyberg, Petter S&au...
    claim paper
    Read More »
    AAAI
    2006
    161views Intelligent Agents» more  AAAI 2006»
    Improved Bounds for Computing Kemeny Rankings
    13 years 8 months ago
    Improved Bounds for Computing Kemeny Rankings
    Download  www.cs.cmu.edu
    Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
    Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
    claim paper
    Read More »
    AAAI
    2004
    103views Intelligent Agents» more  AAAI 2004»
    Shortest Path Discovery Problems: A Framework, Algorithms and Experimental Results
    13 years 8 months ago
    Shortest Path Discovery Problems: A Framework, Algorithms and Experimental Results
    Download  www.aaai.org
    In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
    Csaba Szepesvári
    claim paper
    Read More »
    GVD
    2001
    142views Database» more  GVD 2001»
    An approach to the model-based fragmentation and relational storage of XML-documents
    13 years 8 months ago
    An approach to the model-based fragmentation and relational storage of XML-documents
    Download  www.im.uni-passau.de
    A flexible method to store XML documents in relational or object-relational databases is presented that is based on an adaptable fragmentation. Whereas most known approaches decom...
    Christian Süß
    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.