Sciweavers

    PLANX
    2007
    86views Programming Languages» more  PLANX 2007»
    Lux: A Lightweight, Statically Typed XML Update Language
    13 years 8 months ago
    Lux: A Lightweight, Statically Typed XML Update Language
    Download  homepages.inf.ed.ac.uk
    Several proposals for updating XML have been introduced. Many of them have a rather complicated semantics due to the interaction of side-effects and updates, and some proposals a...
    James Cheney
    claim paper
    Read More »
    STRINGOLOGY
    2008
    138views Programming Languages» more  STRINGOLOGY 2008»
    Conservative String Covering of Indeterminate Strings
    13 years 8 months ago
    Conservative String Covering of Indeterminate Strings
    Download  www.dcs.kcl.ac.uk
    Abstract. We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T[1]T[2] . . . T...
    Pavlos Antoniou, Maxime Crochemore, Costas S. Ilio...
    claim paper
    Read More »
    STRINGOLOGY
    2008
    176views Programming Languages» more  STRINGOLOGY 2008»
    The Road Coloring and Cerny Conjecture
    13 years 8 months ago
    The Road Coloring and Cerny Conjecture
    Download  u.cs.biu.ac.il
    A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
    Avraham Trahtman
    claim paper
    Read More »
    STRINGOLOGY
    2008
    122views Programming Languages» more  STRINGOLOGY 2008»
    Dynamic Burrows-Wheeler Transform
    13 years 8 months ago
    Dynamic Burrows-Wheeler Transform
    Download  www-igm.univ-mlv.fr
    Mikaël Salson, Thierry Lecroq, Martine L&eacu...
    claim paper
    Read More »
    STRINGOLOGY
    2008
    102views Programming Languages» more  STRINGOLOGY 2008»
    On the Uniform Distribution of Strings
    13 years 8 months ago
    On the Uniform Distribution of Strings
    Download  liris.cnrs.fr
    In this paper, we propose the definition of a measure for sets of strings of length not greater than a given number. This measure leads to an instanciation of the uniform distribut...
    Sébastien Rebecchi, Jean-Michel Jolion
    claim paper
    Read More »
    STRINGOLOGY
    2008
    128views Programming Languages» more  STRINGOLOGY 2008»
    In-place Update of Suffix Array while Recoding Words
    13 years 8 months ago
    In-place Update of Suffix Array while Recoding Words
    Download  www.stringology.org
    Matthias Gallé, Pierre Peterlongo, Fran&cce...
    claim paper
    Read More »
    STRINGOLOGY
    2008
    132views Programming Languages» more  STRINGOLOGY 2008»
    Fast Optimal Algorithms for Computing All the Repeats in a String
    13 years 8 months ago
    Fast Optimal Algorithms for Computing All the Repeats in a String
    Download  www.stringology.org
    Simon J. Puglisi, William F. Smyth, Munina Yusufu
    claim paper
    Read More »
    STRINGOLOGY
    2008
    123views Programming Languages» more  STRINGOLOGY 2008»
    An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings
    13 years 8 months ago
    An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings
    Download  www.stringology.org
    William F. Smyth, Shu Wang, Mao Yu
    claim paper
    Read More »
    STRINGOLOGY
    2008
    102views Programming Languages» more  STRINGOLOGY 2008»
    Infinite Smooth Lyndon Words
    13 years 8 months ago
    Infinite Smooth Lyndon Words
    Download  www.lama.univ-savoie.fr
    In a recent paper, Brlek et al showed that some extremal infinite smooth words are also infinite Lyndon words. This result raises a natural question: what are the infinite smooth w...
    Geneviève Paquin
    claim paper
    Read More »
    STRINGOLOGY
    2008
    123views Programming Languages» more  STRINGOLOGY 2008»
    Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
    13 years 8 months ago
    Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
    Download  www.mimuw.edu.pl
    The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
    Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
    claim paper
    Read More »
    « first‹ previous…949596979899100101102…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.