Sciweavers

    966 search results - page 136 / 194
    » Small Alliances in Graphs
    Sort
    View
    FOSSACS
    2008
    Springer
    107views Software Engineering» more  FOSSACS 2008»
    Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
    13 years 11 months ago
    Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
    Download  www.ti.inf.uni-due.de
    In recent years there have been several approaches for the automatic derivation of labels from an unlabeled reactive system. This can be done in such a way that the resulting bisim...
    Guilherme Rangel, Barbara König, Hartmut Ehri...
    claim paper
    Read More »
    EMNLP
    2008
    94views Natural Language Processing» more  EMNLP 2008»
    Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
    13 years 11 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 »
    NETWORKING
    2008
    127views Computer Networks» more  NETWORKING 2008»
    A Distributed Algorithm for Overlay Backbone Multicast Routing in Content Delivery Networks
    13 years 11 months ago
    A Distributed Algorithm for Overlay Backbone Multicast Routing in Content Delivery Networks
    Download  www.cse.unsw.edu.au
    Abstract. To support large-scale live Internet broadcasting services efficiently in content delivery networks (CDNs), it is essential to exploit peer-to-peer capabilities among end...
    Jun Guo, Sanjay Jha
    claim paper
    Read More »
    NETWORKING
    2008
    101views Computer Networks» more  NETWORKING 2008»
    The Effect of Peer Selection with Hopcount or Delay Constraint on Peer-to-Peer Networking
    13 years 11 months ago
    The Effect of Peer Selection with Hopcount or Delay Constraint on Peer-to-Peer Networking
    Download  dutetvg.et.tudelft.nl
    We revisit the peer selection problem of finding the most nearby peer from an initiating node. The metrics to assess the closeness between peers are hopcount and delay, respectivel...
    Siyu Tang, Huijuan Wang, Piet Van Mieghem
    claim paper
    Read More »
    EMNLP
    2006
    99views Natural Language Processing» more  EMNLP 2006»
    Two graph-based algorithms for state-of-the-art WSD
    13 years 11 months ago
    Two graph-based algorithms for state-of-the-art WSD
    Download  acl.ldc.upenn.edu
    This paper explores the use of two graph algorithms for unsupervised induction and tagging of nominal word senses based on corpora. Our main contribution is the optimization of th...
    Eneko Agirre, David Martínez, Oier Lopez de...
    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.