Sciweavers

    IPL
    2007
    81views more  IPL 2007»
    Linear-time algorithms for problems on planar graphs with fixed disk dimension
    13 years 11 months ago
    Linear-time algorithms for problems on planar graphs with fixed disk dimension
    Download  www.csm.lau.edu.lb
    The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
    Faisal N. Abu-Khzam, Michael A. Langston
    claim paper
    Read More »
    IPL
    2007
    89views more  IPL 2007»
    On the longest path algorithm for reconstructing trees from distance matrices
    13 years 11 months ago
    On the longest path algorithm for reconstructing trees from distance matrices
    Download  www.cs.yale.edu
    Culberson and Rudnicki [1] gave an algorithm that reconstructs a degree d restricted tree from its distance matrix. According to their analysis, it runs in time O(dn logd n) for t...
    Lev Reyzin, Nikhil Srivastava
    claim paper
    Read More »
    IPL
    2007
    99views more  IPL 2007»
    Approximation algorithms for minimizing segments in radiation therapy
    13 years 11 months ago
    Approximation algorithms for minimizing segments in radiation therapy
    Download  www.cs.unm.edu
    Intensity modulated radiation therapy (IMRT) is one of the most effective modalities for modern cancer treatment. The key to successful IMRT treatment hinges on the delivery of a...
    Shuang Luan, Jared Saia, Maxwell Young
    claim paper
    Read More »
    IPL
    2007
    111views more  IPL 2007»
    Scalable Bloom Filters
    13 years 11 months ago
    Scalable Bloom Filters
    Download  gsd.di.uminho.pt
    Bloom Filters provide space-efficient storage of sets at the cost of a probability of false positives on membership queries. The size of the filter must be defined a priori bas...
    Paulo Sérgio Almeida, Carlos Baquero, Nuno ...
    claim paper
    Read More »
    IPL
    2007
    78views more  IPL 2007»
    Ensuring the quasi-termination of needed narrowing computations
    13 years 11 months ago
    Ensuring the quasi-termination of needed narrowing computations
    Download  users.dsic.upv.es
    We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
    J. Guadalupe Ramos, Josep Silva, Germán Vid...
    claim paper
    Read More »
    IPL
    2007
    78views more  IPL 2007»
    LP-based solution methods for the asymmetric TSP
    13 years 11 months ago
    LP-based solution methods for the asymmetric TSP
    Download  www.math.ohiou.edu
    We consider an LP relaxation for ATSP. We introduce concepts of high-value and high-flow cycles in LP basic solutions and show that the existence of this kind of cycles would lea...
    Vardges Melkonian
    claim paper
    Read More »
    IPL
    2007
    80views more  IPL 2007»
    Execution time analysis of a top-down R-tree construction algorithm
    13 years 11 months ago
    Execution time analysis of a top-down R-tree construction algorithm
    Download  www.cs.umd.edu
    A detailed CPU execution-time analysis and implementation are given for a bulk loading algorithm to construct R-trees due to García et al. [Y.J. García, M.A. López, S.T. Leuten...
    Houman Alborzi, Hanan Samet
    claim paper
    Read More »
    IPL
    2007
    50views more  IPL 2007»
    Wait-free regular storage from Byzantine components
    13 years 11 months ago
    Wait-free regular storage from Byzantine components
    Download  publications.csail.mit.edu
    We present a simple, efficient, and self-contained construction of a wait-free regular register from Byzantine storage components. Our construction utilizes a novel building block...
    Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...
    claim paper
    Read More »
    IPL
    2007
    122views more  IPL 2007»
    On the longest increasing subsequence of a circular list
    13 years 11 months ago
    On the longest increasing subsequence of a circular list
    Download  www.cs.otago.ac.nz
    The longest increasing circular subsequence (LICS) of a list is considered. A Monte-Carlo algorithm to compute it is given which has worst case execution time O(n3/2 log n) and st...
    Michael H. Albert, Mike D. Atkinson, Doron Nussbau...
    claim paper
    Read More »
    IPL
    2007
    99views more  IPL 2007»
    Substitutions into propositional tautologies
    13 years 11 months ago
    Substitutions into propositional tautologies
    Download  www.karlin.mff.cuni.cz
    We prove that there is a polynomial time substitution (y1, . . . , yn) := g(x1, . . . , xk) with k << n such that whenever the substitution instance A(g(x1, . . . , xk)) of ...
    Jan Krajícek
    claim paper
    Read More »
    « first‹ previous123456next ›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.