Sciweavers

    SIAMCOMP
    1998
    102views more  SIAMCOMP 1998»
    L-Printable Sets
    14 years 14 days ago
    L-Printable Sets
    Download  www.cs.uky.edu
    A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
    Lance Fortnow, Judy Goldsmith, Matthew A. Levy, St...
    claim paper
    Read More »
    SIAMCOMP
    1998
    114views more  SIAMCOMP 1998»
    Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
    14 years 14 days ago
    Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
    Download  www.math.tu-berlin.de
    A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
    Stefan Felsner, Lorenz Wernisch
    claim paper
    Read More »
    SIAMCOMP
    1998
    85views more  SIAMCOMP 1998»
    Separator-Based Sparsification II: Edge and Vertex Connectivity
    14 years 14 days ago
    Separator-Based Sparsification II: Edge and Vertex Connectivity
    Download  reference.kfupm.edu.sa
    We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
    David Eppstein, Zvi Galil, Giuseppe F. Italiano, T...
    claim paper
    Read More »
    SIAMCOMP
    1998
    93views more  SIAMCOMP 1998»
    Localizing a Robot with Minimum Travel
    14 years 14 days ago
    Localizing a Robot with Minimum Travel
    Download  www.cim.mcgill.ca
    Gregory Dudek, Kathleen Romanik, Sue Whitesides
    claim paper
    Read More »
    SIAMCOMP
    1998
    114views more  SIAMCOMP 1998»
    Universal Limit Laws for Depths in Random Trees
    14 years 14 days ago
    Universal Limit Laws for Depths in Random Trees
    Download  cg.scs.carleton.ca
    Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
    Luc Devroye
    claim paper
    Read More »
    SIAMCOMP
    1998
    99views more  SIAMCOMP 1998»
    On the Power of Finite Automata with Both Nondeterministic and Probabilistic States
    14 years 14 days ago
    On the Power of Finite Automata with Both Nondeterministic and Probabilistic States
    Download  www.math.ias.edu
    Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi ...
    claim paper
    Read More »
    SIAMCOMP
    1998
    168views more  SIAMCOMP 1998»
    Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
    14 years 14 days ago
    Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
    Download  reference.kfupm.edu.sa
    This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
    Maw-Shang Chang
    claim paper
    Read More »
    SIAMCOMP
    1998
    86views more  SIAMCOMP 1998»
    Exact Learning of Discretized Geometric Concepts
    14 years 14 days ago
    Exact Learning of Discretized Geometric Concepts
    Download  www.csc.liv.ac.uk
    We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
    Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldm...
    claim paper
    Read More »
    SIAMCOMP
    1998
    125views more  SIAMCOMP 1998»
    Free Bits, PCPs, and Nonapproximability-Towards Tight Results
    14 years 14 days ago
    Free Bits, PCPs, and Nonapproximability-Towards Tight Results
    Download  www.cse.buffalo.edu
    This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
    Mihir Bellare, Oded Goldreich, Madhu Sudan
    claim paper
    Read More »
    SIAMCOMP
    1998
    68views more  SIAMCOMP 1998»
    Guaranteeing Fair Service to Persistent Dependent Tasks
    14 years 14 days ago
    Guaranteeing Fair Service to Persistent Dependent Tasks
    Download  people.csail.mit.edu
    Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Ma...
    claim paper
    Read More »
    « first‹ previous123next ›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-2025, USA.