Sciweavers

    110 search results - page 21 / 22
    » Chain polynomials and Tutte polynomials
    Sort
    View
    DAM
    1999
    128views more  DAM 1999»
    Graph Classes Between Parity and Distance-hereditary Graphs
    13 years 5 months ago
    Graph Classes Between Parity and Distance-hereditary Graphs
    Download  ing.univaq.it
    Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
    Serafino Cicerone, Gabriele Di Stefano
    claim paper
    Read More »
    WWW
    2005
    ACM
    146views Internet Technology» more  WWW 2005»
    PageRank as a function of the damping factor
    14 years 6 months ago
    PageRank as a function of the damping factor
    Download  www2005.org
    PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
    Paolo Boldi, Massimo Santini, Sebastiano Vigna
    claim paper
    Read More »
    STOC
    2006
    ACM
    129views Algorithms» more  STOC 2006»
    Optimal phylogenetic reconstruction
    14 years 6 months ago
    Optimal phylogenetic reconstruction
    Download  www.stat.berkeley.edu
    One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...
    Constantinos Daskalakis, Elchanan Mossel, Sé...
    claim paper
    Read More »
    SIGECOM
    2009
    ACM
    109views ECommerce» more  SIGECOM 2009»
    A new perspective on implementation by voting trees
    14 years 7 days ago
    A new perspective on implementation by voting trees
    Download  people.seas.harvard.edu
    Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
    Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...
    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 4 days 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.