Sciweavers

    IPL
    2006
    86views more  IPL 2006»
    A linear space algorithm for computing a longest common increasing subsequence
    13 years 5 months ago
    A linear space algorithm for computing a longest common increasing subsequence
    Download  www.cs.ust.hk
    Yoshifumi Sakai
    claim paper
    Read More »
    IPL
    2006
    69views more  IPL 2006»
    On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
    13 years 5 months ago
    On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
    Download  ccc.cs.uni-duesseldorf.de
    We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
    André Große, Jörg Rothe, Gerd We...
    claim paper
    Read More »
    IPL
    2006
    88views more  IPL 2006»
    On Quickselect, partial sorting and Multiple Quickselect
    13 years 5 months ago
    On Quickselect, partial sorting and Multiple Quickselect
    Download  www.dmg.tuwien.ac.at
    We present explicit solutions of a class of recurrences related to the Quickselect algorithm. Thus we are immediately able to solve recurrences arising at the partial sorting probl...
    Markus Kuba
    claim paper
    Read More »
    IPL
    2006
    115views more  IPL 2006»
    Approximate maximum weight branchings
    13 years 5 months ago
    Approximate maximum weight branchings
    Download  cis.poly.edu
    We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
    Amitabha Bagchi, Ankur Bhargava, Torsten Suel
    claim paper
    Read More »
    IPL
    2006
    99views more  IPL 2006»
    Computational complexity of queries based on itemsets
    13 years 5 months ago
    Computational complexity of queries based on itemsets
    Download  users.ics.tkk.fi
    We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
    Nikolaj Tatti
    claim paper
    Read More »
    IPL
    2006
    91views more  IPL 2006»
    Improved undecidability results on weighted timed automata
    13 years 5 months ago
    Improved undecidability results on weighted timed automata
    Download  www.lsv.ens-cachan.fr
    In this paper, we strengthen two recent undecidability results of [9,10] about weighted timed automata, an extension of timed automata with cost variables. More precisely, we prop...
    Patricia Bouyer, Thomas Brihaye, Nicolas Markey
    claim paper
    Read More »
    IPL
    2006
    74views more  IPL 2006»
    Periodic and Sturmian languages
    13 years 5 months ago
    Periodic and Sturmian languages
    Download  combio.abo.fi
    Counting the number of distinct factors in the words of a language gives a measure of complexity for that language similar to the factor-complexity of infinite words. Similarly as ...
    Lucian Ilie, Solomon Marcus, Ion Petre
    claim paper
    Read More »
    IPL
    2006
    109views more  IPL 2006»
    Knuth-Bendix completion of theories of commuting group endomorphisms
    13 years 5 months ago
    Knuth-Bendix completion of theories of commuting group endomorphisms
    Download  www.cs.uiowa.edu
    Knuth-Bendix completions of the equational theories of k 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This impro...
    Aaron Stump, Bernd Löchner
    claim paper
    Read More »
    IPL
    2006
    96views more  IPL 2006»
    A closer look at constraints as processes
    13 years 5 months ago
    A closer look at constraints as processes
    Download  www.tcs.tifr.res.in
    N. Raja, R. K. Shyamasundar
    claim paper
    Read More »
    IPL
    2006
    81views more  IPL 2006»
    Overcoming observability problems in distributed test architectures
    13 years 5 months ago
    Overcoming observability problems in distributed test architectures
    Download  people.brunel.ac.uk
    Jessica Chen, Robert M. Hierons, Hasan Ural
    claim paper
    Read More »
    « first‹ previous12345678next ›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.