Sciweavers

    STOC
    2009
    ACM
    238views Algorithms» more  STOC 2009»
    On the convergence of regret minimization dynamics in concave games
    14 years 5 months ago
    On the convergence of regret minimization dynamics in concave games
    Download  www.cs.tau.ac.il
    We study a general sub-class of concave games, which we call socially concave games. We show that if each player follows any no-external regret minimization procedure then the dyn...
    Eyal Even-Dar, Yishay Mansour, Uri Nadav
    claim paper
    Read More »
    STOC
    2009
    ACM
    171views Algorithms» more  STOC 2009»
    On the geometry of graphs with a forbidden minor
    14 years 5 months ago
    On the geometry of graphs with a forbidden minor
    Download  people.csail.mit.edu
    We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
    James R. Lee, Anastasios Sidiropoulos
    claim paper
    Read More »
    STOC
    2009
    ACM
    106views Algorithms» more  STOC 2009»
    An axiomatic approach to algebrization
    14 years 5 months ago
    An axiomatic approach to algebrization
    Download  cseweb.ucsd.edu
    Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
    Russell Impagliazzo, Valentine Kabanets, Antonina ...
    claim paper
    Read More »
    STOC
    2009
    ACM
    106views Algorithms» more  STOC 2009»
    Random graphs and the parity quantifier
    14 years 5 months ago
    Random graphs and the parity quantifier
    Download  web.mit.edu
    The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
    Phokion G. Kolaitis, Swastik Kopparty
    claim paper
    Read More »
    STOC
    2009
    ACM
    120views Algorithms» more  STOC 2009»
    Bit-probe lower bounds for succinct data structures
    14 years 5 months ago
    Bit-probe lower bounds for succinct data structures
    Download  www.cs.umd.edu
    We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
    Emanuele Viola
    claim paper
    Read More »
    STOC
    2009
    ACM
    120views Algorithms» more  STOC 2009»
    An efficient algorithm for partial order production
    14 years 5 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 5 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 5 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 5 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 5 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 »
    « first‹ previous123456next ›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.