Sciweavers

    496 search results - page 37 / 100
    » Machine models and lower bounds for query processing
    Sort
    View
    PODC
    2010
    ACM
    165views Distributed and Parallel Com...» more  PODC 2010»
    Group mutual exclusion in O(log n) RMR
    13 years 11 months ago
    Group mutual exclusion in O(log n) RMR
    Download  www.mpi-inf.mpg.de
    We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
    Vibhor Bhatt, Chien-Chung Huang
    claim paper
    Read More »
    ESWS
    2007
    Springer
    164views Internet Technology» more  ESWS 2007»
    An Ontology for Executable Business Processes
    14 years 1 months ago
    An Ontology for Executable Business Processes
    Download  ftp.informatik.rwth-aachen.de
    Abstract The Web Service Business Process Execution Language (WSBPEL) is the de facto standard for describing workflow-like compositions of Web services, so-called Web service orc...
    Jörg Nitzsche, Daniel Wutke, Tammo van Lessen
    claim paper
    Read More »
    QEST
    2008
    IEEE
    145views Modeling and Simulation» more  QEST 2008»
    Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
    14 years 2 months ago
    Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
    Download  www.era.lib.ed.ac.uk
    We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
    Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
    claim paper
    Read More »
    ICML
    2005
    IEEE
    195views Machine Learning» more  ICML 2005»
    Active learning for Hidden Markov Models: objective functions and algorithms
    14 years 8 months ago
    Active learning for Hidden Markov Models: objective functions and algorithms
    Download  www.cs.cmu.edu
    Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
    Brigham Anderson, Andrew Moore
    claim paper
    Read More »
    LMCS
    2007
    132views more  LMCS 2007»
    The Complexity of Model Checking Higher-Order Fixpoint Logic
    13 years 7 months ago
    The Complexity of Model Checking Higher-Order Fixpoint Logic
    Download  www2.tcs.ifi.lmu.de
    Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
    Roland Axelsson, Martin Lange, Rafal Somla
    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.