Sciweavers

    141 search results - page 23 / 29
    » An Algorithm for Transformation of Finite Automata to Regula...
    Sort
    View
    JUCS
    2010
    130views more  JUCS 2010»
    On the Linear Number of Matching Substrings
    13 years 7 months ago
    On the Linear Number of Matching Substrings
    Download  www.jucs.org
    Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
    Yo-Sub Han
    claim paper
    Read More »
    SIAMIS
    2008
    279views more  SIAMIS 2008»
    A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
    13 years 8 months ago
    A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
    Download  www.caam.rice.edu
    We propose, analyze and test an alternating minimization algorithm for recovering images from blurry and noisy observations with total variation (TV) regularization. This algorith...
    Yilun Wang, Junfeng Yang, Wotao Yin, Yin Zhang
    claim paper
    Read More »
    PODS
    2007
    ACM
    171views Database» more  PODS 2007»
    Monadic datalog over finite structures with bounded treewidth
    14 years 8 months ago
    Monadic datalog over finite structures with bounded treewidth
    Download  www.dbai.tuwien.ac.at
    Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
    Georg Gottlob, Reinhard Pichler, Fang Wei
    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 10 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 »
    ASE
    2005
    137views more  ASE 2005»
    Rewriting-Based Techniques for Runtime Verification
    13 years 8 months ago
    Rewriting-Based Techniques for Runtime Verification
    Download  www.havelund.com
    Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
    Grigore Rosu, Klaus Havelund
    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.