Sciweavers

    COMPGEOM
    2010
    ACM
    221views Discrete Geometry» more  COMPGEOM 2010»
    Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
    13 years 9 months ago
    Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
    Download  www.daimi.au.dk
    Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
    Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
    claim paper
    Read More »
    ISAAC
    2007
    Springer
    109views Algorithms» more  ISAAC 2007»
    A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem
    13 years 10 months ago
    A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem
    Download  www.cosc.canterbury.ac.nz
    We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
    Sung Eun Bae, Tadao Takaoka
    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.