Sciweavers

    15375 search results - page 201 / 3075
    » cans 2008
    Sort
    View
    TCS
    2008
    148views Theoretical Computer Science» more  TCS 2008»
    The moving curve ideal and the Rees algebra
    13 years 8 months ago
    The moving curve ideal and the Rees algebra
    Download  math.ohiou.edu
    These are notes for a lecture given at Ohio University on June 3, 2006. An important topic in commutative algebra is the Rees algebra of an ideal in a commutative ring. The Rees al...
    David A. Cox
    claim paper
    Read More »
    TCS
    2008
    95views Theoretical Computer Science» more  TCS 2008»
    On the weight of universal insertion grammars
    13 years 8 months ago
    On the weight of universal insertion grammars
    Download  www.csd.uwo.ca
    We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achiev...
    Lila Kari, Petr Sosík
    claim paper
    Read More »
    TCS
    2008
    88views Theoretical Computer Science» more  TCS 2008»
    On the structure of graphs in the Caucal hierarchy
    13 years 8 months ago
    On the structure of graphs in the Caucal hierarchy
    Download  www.mathematik.tu-darmstadt.de
    We investigate the structure of graphs in the Caucal hierarchy. We provide criteria concerning the degree of vertices or the length of paths which can be used to show that a given ...
    Achim Blumensath
    claim paper
    Read More »
    IPL
    2007
    50views more  IPL 2007»
    Wait-free regular storage from Byzantine components
    13 years 8 months ago
    Wait-free regular storage from Byzantine components
    Download  publications.csail.mit.edu
    We present a simple, efficient, and self-contained construction of a wait-free regular register from Byzantine storage components. Our construction utilizes a novel building block...
    Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...
    claim paper
    Read More »
    TCS
    2008
    120views Theoretical Computer Science» more  TCS 2008»
    The complexity of uniform Nash equilibria and related regular subgraph problems
    13 years 8 months ago
    The complexity of uniform Nash equilibria and related regular subgraph problems
    Download  www.mpi-inf.mpg.de
    We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
    Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
    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.