Sciweavers

    ITA
    2000
    98views Communications» more  ITA 2000»
    Construction of very hard functions for multiparty communication complexity
    13 years 8 months ago
    Construction of very hard functions for multiparty communication complexity
    Download  www.pims.math.ca
    We consider the multiparty communication model de ned in 4] using the formalism from 8]. First, we correct an inaccuracy in the proof of the fundamental result of 6] providing a lo...
    Ján Manuch
    claim paper
    Read More »
    ITA
    2000
    82views Communications» more  ITA 2000»
    On a paper by Castelli, Mignosi, Restivo
    13 years 8 months ago
    On a paper by Castelli, Mignosi, Restivo
    Download  www.liafa.jussieu.fr
    Fine and Wilf's theorem has recently been extended to words having three periods. Following the method of the authors we extend it to an arbitrary number of periods and deduce...
    Jacques Justin
    claim paper
    Read More »
    ITA
    2007
    118views Communications» more  ITA 2007»
    Uniformly bounded duplication codes
    13 years 8 months ago
    Uniformly bounded duplication codes
    Download  www.wortspieler.org
    Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing dupl...
    Peter Leupold, Victor Mitrana
    claim paper
    Read More »
    ITA
    2007
    85views Communications» more  ITA 2007»
    An algorithm for deciding if a polyomino tiles the plane
    13 years 8 months ago
    An algorithm for deciding if a polyomino tiles the plane
    Download  www.lama.univ-savoie.fr
    : For polyominoes coded by their boundary word, we describe a quadratic O(n2) algorithm in the boundary length n which improves the naive O(n4) algorithm. Techniques used emanate f...
    Ian Gambini, Laurent Vuillon
    claim paper
    Read More »
    ITA
    2007
    84views Communications» more  ITA 2007»
    On substitution invariant Sturmian words: an application of Rauzy fractals
    13 years 8 months ago
    On substitution invariant Sturmian words: an application of Rauzy fractals
    Download  www.lirmm.fr
    Valérie Berthé, Hiromi Ei, Shunji It...
    claim paper
    Read More »
    ITA
    2007
    153views Communications» more  ITA 2007»
    Deciding inclusion of set constants over infinite non-strict data structures
    13 years 8 months ago
    Deciding inclusion of set constants over infinite non-strict data structures
    Download  www.ki.informatik.uni-frankfurt.de
    Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
    Manfred Schmidt-Schauß, David Sabel, Marko S...
    claim paper
    Read More »
    ITA
    2007
    75views Communications» more  ITA 2007»
    Substitutions par des motifs en dimension 1
    13 years 8 months ago
    Substitutions par des motifs en dimension 1
    Download  iml.univ-mrs.fr
    N. Pytheas Fogg
    claim paper
    Read More »
    ITA
    2007
    80views Communications» more  ITA 2007»
    Recursive coalgebras of finitary functors
    13 years 8 months ago
    Recursive coalgebras of finitary functors
    Download  www.ra.informatik.uni-stuttgart.de
    Abstract For finitary set functors preserving inverse images several concepts of coalgebras A are proved to be equivalent: (i) A has a homomorphism into the initial algebra, (ii) ...
    Jirí Adámek, Dominik Lücke, Ste...
    claim paper
    Read More »
    ITA
    2007
    94views Communications» more  ITA 2007»
    Fast and correctly rounded logarithms in double-precision
    13 years 8 months ago
    Fast and correctly rounded logarithms in double-precision
    Download  www.ens-lyon.fr
    Florent de Dinechin, Christoph Quirin Lauter, Jean...
    claim paper
    Read More »
    ITA
    2007
    101views Communications» more  ITA 2007»
    Learning tree languages from text
    13 years 8 months ago
    Learning tree languages from text
    Download  www.informatik.uni-trier.de
    We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
    Henning Fernau
    claim paper
    Read More »
    « first‹ previous…176177178179180181182183184…next ›last »
    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.