Sciweavers

    469 search results - page 63 / 94
    » Directed Graphs of Entanglement Two
    Sort
    View
    SODA
    2004
    ACM
    120views Algorithms» more  SODA 2004»
    Optimal routing in Chord
    13 years 9 months ago
    Optimal routing in Chord
    Download  infolab.stanford.edu
    We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
    Prasanna Ganesan, Gurmeet Singh Manku
    claim paper
    Read More »
    COLING
    1996
    98views Computational Linguistics» more  COLING 1996»
    Distributedness and Non-Linearity of LOLITA's Semantic Network
    13 years 9 months ago
    Distributedness and Non-Linearity of LOLITA's Semantic Network
    Download  acl.ldc.upenn.edu
    'Phis paper describes SemNet the internal Knowledge t{epresentation lbr LOLI'I'A I. LOMTA is a large scale Natural Language Engineering (NLE) system. As such the in...
    S. Short, Simon Shiu, Roberto Garigliano
    claim paper
    Read More »
    PSTV
    1993
    123views Hardware» more  PSTV 1993»
    On the Verification of Temporal Properties
    13 years 9 months ago
    On the Verification of Temporal Properties
    Download  spinroot.com
    We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
    Patrice Godefroid, Gerard J. Holzmann
    claim paper
    Read More »
    UAI
    1993
    112views Artificial Intelligence» more  UAI 1993»
    On reasoning in networks with qualitative uncertainty
    13 years 9 months ago
    On reasoning in networks with qualitative uncertainty
    Download  www.sci.brooklyn.cuny.edu
    In this paper some initialwork towards a new approach to qualitative reasoning under uncertainty is presented. This method is not only applicable to qualitative probabilistic reas...
    Simon Parsons, E. H. Mamdani
    claim paper
    Read More »
    CSDA
    2010
    118views more  CSDA 2010»
    Grapham: Graphical models with adaptive random walk Metropolis algorithms
    13 years 7 months ago
    Grapham: Graphical models with adaptive random walk Metropolis algorithms
    Download  users.jyu.fi
    Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
    Matti Vihola
    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.