Sciweavers

    4485 search results - page 9 / 897
    » Equivalences on Observable Processes
    Sort
    View
    IANDC
    2010
    68views more  IANDC 2010»
    On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
    13 years 7 months ago
    On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
    Download  homepages.inf.ed.ac.uk
    Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
    Antonín Kucera, Richard Mayr
    claim paper
    Read More »
    NIPS
    2003
    289views Information Technology» more  NIPS 2003»
    Gaussian Process Latent Variable Models for Visualisation of High Dimensional Data
    13 years 10 months ago
    Gaussian Process Latent Variable Models for Visualisation of High Dimensional Data
    Download  books.nips.cc
    In this paper we introduce a new underlying probabilistic model for principal component analysis (PCA). Our formulation interprets PCA as a particular Gaussian process prior on a ...
    Neil D. Lawrence
    claim paper
    Read More »
    TIT
    2002
    82views more  TIT 2002»
    Order estimation for a special class of hidden Markov sources and binary renewal processes
    13 years 8 months ago
    Order estimation for a special class of hidden Markov sources and binary renewal processes
    Download  www.clsp.jhu.edu
    We consider the estimation of the order, i.e., the number of hidden states, of a special class of discrete-time finite-alphabet hidden Markov sources. This class can be characteriz...
    Sanjeev Khudanpur, Prakash Narayan
    claim paper
    Read More »
    IPMI
    2011
    Springer
    279views Medical Imaging» more  IPMI 2011»
    Learning an Atlas of a Cognitive Process in Its Functional Geometry
    13 years 3 hour ago
    Learning an Atlas of a Cognitive Process in Its Functional Geometry
    Download  people.csail.mit.edu
    In this paper we construct an atlas that captures functional characteristics of a cognitive process from a population of individuals. The functional connectivity is encoded in a lo...
    Georg Langs, Danial Lashkari, Andrew Sweet, Yanmei...
    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 3 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 »
    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.