Sciweavers

    SODA
    2008
    ACM
    92views Algorithms» more  SODA 2008»
    An algorithm for improving graph partitions
    13 years 6 months ago
    An algorithm for improving graph partitions
    Download  www.stanford.edu
    Reid Andersen, Kevin J. Lang
    claim paper
    Read More »
    SODA
    2008
    ACM
    135views Algorithms» more  SODA 2008»
    Rapid mixing of Gibbs sampling on graphs that are sparse on average
    13 years 6 months ago
    Rapid mixing of Gibbs sampling on graphs that are sparse on average
    Download  www.stat.berkeley.edu
    Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional distributions defined on graphs. Of special interest is the behavior of Gibbs sa...
    Elchanan Mossel, Allan Sly
    claim paper
    Read More »
    SODA
    2008
    ACM
    123views Algorithms» more  SODA 2008»
    Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
    13 years 6 months ago
    Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
    Download  www.cs.rutgers.edu
    Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
    Xiaomin Chen, János Pach, Mario Szegedy, G&...
    claim paper
    Read More »
    SODA
    2008
    ACM
    144views Algorithms» more  SODA 2008»
    Fast dimension reduction using Rademacher series on dual BCH codes
    13 years 6 months ago
    Fast dimension reduction using Rademacher series on dual BCH codes
    Download  www.cs.yale.edu
    The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
    Nir Ailon, Edo Liberty
    claim paper
    Read More »
    SODA
    2008
    ACM
    89views Algorithms» more  SODA 2008»
    Product growth and mixing in finite groups
    13 years 6 months ago
    Product growth and mixing in finite groups
    Download  people.cs.uchicago.edu
    László Babai, Nikolay Nikolov, L&aac...
    claim paper
    Read More »
    SODA
    2008
    ACM
    110views Algorithms» more  SODA 2008»
    Why simple hash functions work: exploiting the entropy in a data stream
    13 years 6 months ago
    Why simple hash functions work: exploiting the entropy in a data stream
    Download  www.eecs.harvard.edu
    Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
    Michael Mitzenmacher, Salil P. Vadhan
    claim paper
    Read More »
    SODA
    2008
    ACM
    104views Algorithms» more  SODA 2008»
    Ranged hash functions and the price of churn
    13 years 6 months ago
    Ranged hash functions and the price of churn
    Download  www.cs.yale.edu
    Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
    James Aspnes, Muli Safra, Yitong Yin
    claim paper
    Read More »
    SODA
    2008
    ACM
    75views Algorithms» more  SODA 2008»
    Recognizing partial cubes in quadratic time
    13 years 6 months ago
    Recognizing partial cubes in quadratic time
    Download  www.ics.uci.edu
    David Eppstein
    claim paper
    Read More »
    SODA
    2008
    ACM
    124views Algorithms» more  SODA 2008»
    Competitive queue management for latency sensitive packets
    13 years 6 months ago
    Competitive queue management for latency sensitive packets
    Download  eprints.pascal-network.org
    We consider the online problem of non-preemptive queue management. An online sequence of packets arrive, each of which has an associated intrinsic value. Packets can be accepted t...
    Amos Fiat, Yishay Mansour, Uri Nadav
    claim paper
    Read More »
    SODA
    2008
    ACM
    75views Algorithms» more  SODA 2008»
    Graph balancing: a special case of scheduling unrelated parallel machines
    13 years 6 months ago
    Graph balancing: a special case of scheduling unrelated parallel machines
    Download  artax.karlin.mff.cuni.cz
    Tomás Ebenlendr, Marek Krcal, Jiri Sgall
    claim paper
    Read More »
    « first‹ previous123456789next ›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.