Sciweavers

    16 search results - page 2 / 4
    » soda 1996
    Sort
    View
    SODA
    1996
    ACM
    121views Algorithms» more  SODA 1996»
    Optimal Placement of Convex Polygons to Maximize Point Containment
    13 years 6 months ago
    Optimal Placement of Convex Polygons to Maximize Point Containment
    Download  community.middlebury.edu
    Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
    Matthew Dickerson, Daniel Scharstein
    claim paper
    Read More »
    SODA
    1994
    ACM
    88views Algorithms» more  SODA 1994»
    Optimal Prediction for Prefetching in the Worst Case
    13 years 6 months ago
    Optimal Prediction for Prefetching in the Worst Case
    Download  www.ittc.ku.edu
    Response time delays caused by I/O are a major problem in many systems and database applications. Prefetching and cache replacement methods are attracting renewed attention because...
    P. Krishnan, Jeffrey Scott Vitter
    claim paper
    Read More »
    SODA
    1996
    ACM
    95views Algorithms» more  SODA 1996»
    RNC Algorithms for the Uniform Generation of Combinatorial Structures
    13 years 6 months ago
    RNC Algorithms for the Uniform Generation of Combinatorial Structures
    Download  www.csc.liv.ac.uk
    We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
    Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
    claim paper
    Read More »
    SODA
    1996
    ACM
    101views Algorithms» more  SODA 1996»
    Randomized Robot Navigation Algorithms
    13 years 6 months ago
    Randomized Robot Navigation Algorithms
    Download  www.cs.cmu.edu
    We consider the problem faced by a mobile robot that has to reach a given target by traveling through an unmapped region in the plane containing oriented rectangular obstacles. We...
    Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Kar...
    claim paper
    Read More »
    SODA
    1996
    ACM
    157views Algorithms» more  SODA 1996»
    Routing and Admission Control in General Topology Networks with Poisson Arrivals
    13 years 6 months ago
    Routing and Admission Control in General Topology Networks with Poisson Arrivals
    Download  infolab.stanford.edu
    Emerging high speed networks will carry tra c for services such as video-on-demand and video teleconferencing that require resource reservation along the path on which the tra c i...
    Anil Kamath, Omri Palmon, Serge A. Plotkin
    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.