Sciweavers

    STOC
    2009
    ACM
    120views Algorithms» more  STOC 2009»
    An efficient algorithm for partial order production
    14 years 11 months ago
    An efficient algorithm for partial order production
    Download  www.iwr.uni-heidelberg.de
    Gwenaël Joret, J. Ian Munro, Jean Cardinal, R...
    claim paper
    Read More »
    STOC
    2009
    ACM
    87views Algorithms» more  STOC 2009»
    Randomly supported independence and resistance
    14 years 11 months ago
    Randomly supported independence and resistance
    Download  www.csc.kth.se
    We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
    Per Austrin, Johan Håstad
    claim paper
    Read More »
    STOC
    2009
    ACM
    159views Algorithms» more  STOC 2009»
    Message passing algorithms and improved LP decoding
    14 years 11 months ago
    Message passing algorithms and improved LP decoding
    Download  www.cs.princeton.edu
    Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
    Sanjeev Arora, Constantinos Daskalakis, David Steu...
    claim paper
    Read More »
    STOC
    2009
    ACM
    133views Algorithms» more  STOC 2009»
    Near-perfect load balancing by randomized rounding
    14 years 11 months ago
    Near-perfect load balancing by randomized rounding
    Download  www.mpi-inf.mpg.de
    We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
    Tobias Friedrich, Thomas Sauerwald
    claim paper
    Read More »
    STOC
    2009
    ACM
    187views Algorithms» more  STOC 2009»
    Artin automorphisms, cyclotomic function fields, and folded list-decodable codes
    14 years 11 months ago
    Artin automorphisms, cyclotomic function fields, and folded list-decodable codes
    Download  eccc.hpi-web.de
    Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
    Venkatesan Guruswami
    claim paper
    Read More »
    STOC
    2009
    ACM
    172views Algorithms» more  STOC 2009»
    Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
    14 years 11 months ago
    Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
    Download  www.cs.brown.edu
    We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
    Marek Karpinski, Warren Schudy
    claim paper
    Read More »
    STOC
    2009
    ACM
    123views Algorithms» more  STOC 2009»
    An improved constant-time approximation algorithm for maximum~matchings
    14 years 11 months ago
    An improved constant-time approximation algorithm for maximum~matchings
    Download  www.lab2.kuis.kyoto-u.ac.jp
    This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
    Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
    claim paper
    Read More »
    STOC
    2009
    ACM
    119views Algorithms» more  STOC 2009»
    Explicit construction of a small epsilon-net for linear threshold functions
    14 years 11 months ago
    Explicit construction of a small epsilon-net for linear threshold functions
    Download  www.cs.technion.ac.il
    We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...
    Yuval Rabani, Amir Shpilka
    claim paper
    Read More »
    STOC
    2009
    ACM
    133views Algorithms» more  STOC 2009»
    New direct-product testers and 2-query PCPs
    14 years 11 months ago
    New direct-product testers and 2-query PCPs
    Download  www.cs.sfu.ca
    The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
    Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
    claim paper
    Read More »
    STOC
    2009
    ACM
    156views Algorithms» more  STOC 2009»
    Polynomial-time theory of matrix groups
    14 years 11 months ago
    Polynomial-time theory of matrix groups
    Download  people.cs.uchicago.edu
    We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
    László Babai, Robert Beals, Á...
    claim paper
    Read More »
    « first‹ previous…514515516517518519520521522next ›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.