Sciweavers

    SODA
    2008
    ACM
    88views Algorithms» more  SODA 2008»
    A near-linear time algorithm for computing replacement paths in planar directed graphs
    13 years 11 months ago
    A near-linear time algorithm for computing replacement paths in planar directed graphs
    Download  www.wisdom.weizmann.ac.il
    Yuval Emek, David Peleg, Liam Roditty
    claim paper
    Read More »
    SODA
    2008
    ACM
    106views Algorithms» more  SODA 2008»
    (Almost) optimal coordination mechanisms for unrelated machine scheduling
    13 years 11 months ago
    (Almost) optimal coordination mechanisms for unrelated machine scheduling
    Download  people.csail.mit.edu
    Yossi Azar, Kamal Jain, Vahab S. Mirrokni
    claim paper
    Read More »
    SODA
    2008
    ACM
    76views Algorithms» more  SODA 2008»
    Non-clairvoyant scheduling with precedence constraints
    13 years 11 months ago
    Non-clairvoyant scheduling with precedence constraints
    Download  cost295.net
    Julien Robert, Nicolas Schabanel
    claim paper
    Read More »
    SODA
    2008
    ACM
    98views Algorithms» more  SODA 2008»
    Explicit constructions for compressed sensing of sparse signals
    13 years 11 months ago
    Explicit constructions for compressed sensing of sparse signals
    Download  people.csail.mit.edu
    Piotr Indyk
    claim paper
    Read More »
    SODA
    2008
    ACM
    96views Algorithms» more  SODA 2008»
    Unconditionally reliable message transmission in directed networks
    13 years 11 months ago
    Unconditionally reliable message transmission in directed networks
    Download  prasantgopal.com
    In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
    Bhavani Shankar, Prasant Gopal, Kannan Srinathan, ...
    claim paper
    Read More »
    SODA
    2008
    ACM
    134views Algorithms» more  SODA 2008»
    Fast algorithms for finding proper strategies in game trees
    13 years 11 months ago
    Fast algorithms for finding proper strategies in game trees
    Download  www.daimi.au.dk
    We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
    Peter Bro Miltersen, Troels Bjerre Sørensen
    claim paper
    Read More »
    SODA
    2008
    ACM
    59views Algorithms» more  SODA 2008»
    Universality of random graphs
    13 years 11 months ago
    Universality of random graphs
    Download  www.mathcs.emory.edu
    Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vo...
    claim paper
    Read More »
    SODA
    2008
    ACM
    143views Algorithms» more  SODA 2008»
    Dynamic optimality for skip lists and B-trees
    13 years 11 months ago
    Dynamic optimality for skip lists and B-trees
    Download  www.ulb.ac.be
    Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
    Prosenjit Bose, Karim Douïeb, Stefan Langerma...
    claim paper
    Read More »
    SODA
    2008
    ACM
    86views Algorithms» more  SODA 2008»
    Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
    13 years 11 months ago
    Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
    Download  www.cs.cmu.edu
    We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
    Guy E. Blelloch
    claim paper
    Read More »
    SODA
    2008
    ACM
    122views Algorithms» more  SODA 2008»
    Fast approximation of the permanent for very dense problems
    13 years 11 months ago
    Fast approximation of the permanent for very dense problems
    Download  www.math.duke.edu
    Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
    Mark Huber, Jenny Law
    claim paper
    Read More »
    « first‹ previous…181182183184185186187188189…next ›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.