Sciweavers

    ALGORITHMICA
    2008
    71views more  ALGORITHMICA 2008»
    Improved Approximate String Matching Using Compressed Suffix Data Structures
    14 years 6 days ago
    Improved Approximate String Matching Using Compressed Suffix Data Structures
    Download  www.springerlink.com
    Tak Wah Lam, Wing-Kin Sung, Swee-Seong Wong
    claim paper
    Read More »
    ALGORITHMICA
    2008
    95views more  ALGORITHMICA 2008»
    Optimality in External Memory Hashing
    14 years 6 days ago
    Optimality in External Memory Hashing
    Download  www.it-c.dk
    Hash tables on external memory are commonly used for indexing in database management systems. In this paper we present an algorithm that, in an asymptotic sense, achieves the best...
    Morten Skaarup Jensen, Rasmus Pagh
    claim paper
    Read More »
    ALGORITHMICA
    2008
    72views more  ALGORITHMICA 2008»
    Treewidth Lower Bounds with Brambles
    14 years 6 days ago
    Treewidth Lower Bounds with Brambles
    Download  www.zib.de
    Hans L. Bodlaender, Alexander Grigoriev, Arie M. C...
    claim paper
    Read More »
    ALGORITHMICA
    2008
    110views more  ALGORITHMICA 2008»
    Bandwidth-Constrained Allocation in Grid Computing
    14 years 22 days ago
    Bandwidth-Constrained Allocation in Grid Computing
    Download  www.cs.ucsb.edu
    Grid computing systems pool together the resources of many workstations to create a virtual computing reservoir. Users can "draw" resources using a pay-as-you-go model, c...
    Anshul Kothari, Subhash Suri, Yunhong Zhou
    claim paper
    Read More »
    ALGORITHMICA
    2008
    79views more  ALGORITHMICA 2008»
    Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
    14 years 22 days ago
    Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
    Download  biogeometry.duke.edu
    The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
    Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...
    claim paper
    Read More »
    ALGORITHMICA
    2008
    88views more  ALGORITHMICA 2008»
    Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
    14 years 22 days ago
    Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
    Download  www.cs.lu.se
    We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
    Andreas Björklund, Thore Husfeldt
    claim paper
    Read More »
    ALGORITHMICA
    2008
    115views more  ALGORITHMICA 2008»
    Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection
    14 years 22 days ago
    Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection
    Download  theinf1.informatik.uni-jena.de
    Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been spent ...
    Falk Hüffner, Sebastian Wernicke, Thomas Zich...
    claim paper
    Read More »
    ALGORITHMICA
    2008
    95views more  ALGORITHMICA 2008»
    On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms
    14 years 22 days ago
    On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms
    Download  www.ii.uib.no
    Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, I...
    claim paper
    Read More »
    ALGORITHMICA
    2008
    42views more  ALGORITHMICA 2008»
    Solving Connected Dominating Set Faster than 2 n
    14 years 22 days ago
    Solving Connected Dominating Set Faster than 2 n
    Download  www.dsi.uniroma1.it
    Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
    claim paper
    Read More »
    ALGORITHMICA
    2008
    111views more  ALGORITHMICA 2008»
    Fixed-Parameter Complexity of Minimum Profile Problems
    14 years 22 days ago
    Fixed-Parameter Complexity of Minimum Profile Problems
    Download  www.cs.rhul.ac.uk
    The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
    Gregory Gutin, Stefan Szeider, Anders Yeo
    claim paper
    Read More »
    123next ›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.