Sciweavers

    SODA
    2012
    ACM
    195views Algorithms» more  SODA 2012»
    Concentration and moment inequalities for polynomials of independent random variables
    12 years 23 days ago
    Concentration and moment inequalities for polynomials of independent random variables
    Download  siam.omnibooksonline.com
    In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
    Warren Schudy, Maxim Sviridenko
    claim paper
    Read More »
    SODA
    2012
    ACM
    224views Algorithms» more  SODA 2012»
    Algorithms for the transportation problem in geometric settings
    12 years 23 days ago
    Algorithms for the transportation problem in geometric settings
    Download  web.eecs.umich.edu
    R. Sharathkumar, Pankaj K. Agarwal
    claim paper
    Read More »
    SODA
    2012
    ACM
    218views Algorithms» more  SODA 2012»
    Linear kernels for (connected) dominating set on H-minor-free graphs
    12 years 23 days ago
    Linear kernels for (connected) dominating set on H-minor-free graphs
    Download  www.ii.uib.no
    We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
    Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
    claim paper
    Read More »
    SODA
    2012
    ACM
    185views Algorithms» more  SODA 2012»
    On a linear program for minimum-weight triangulation
    12 years 23 days ago
    On a linear program for minimum-weight triangulation
    Download  ita.ucsd.edu
    ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
    Arman Yousefi, Neal E. Young
    claim paper
    Read More »
    SODA
    2012
    ACM
    177views Algorithms» more  SODA 2012»
    Stochastic coalescence in logarithmic time
    12 years 23 days ago
    Stochastic coalescence in logarithmic time
    Download  www.math.cmu.edu
    The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
    Po-Shen Loh, Eyal Lubetzky
    claim paper
    Read More »
    SODA
    2012
    ACM
    191views Algorithms» more  SODA 2012»
    Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
    12 years 23 days ago
    Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
    Download  www.cs.brown.edu
    We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
    Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sha...
    claim paper
    Read More »
    SODA
    2012
    ACM
    229views Algorithms» more  SODA 2012»
    Approximation algorithms for stochastic orienteering
    12 years 23 days ago
    Approximation algorithms for stochastic orienteering
    Download  www.cs.cmu.edu
    In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
    Anupam Gupta, Ravishankar Krishnaswamy, Viswanath ...
    claim paper
    Read More »
    SODA
    2012
    ACM
    212views Algorithms» more  SODA 2012»
    Parallelism and time in hierarchical self-assembly
    12 years 23 days ago
    Parallelism and time in hierarchical self-assembly
    Download  www.dna.caltech.edu
    We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...
    Ho-Lin Chen, David Doty
    claim paper
    Read More »
    SODA
    2012
    ACM
    217views Algorithms» more  SODA 2012»
    Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
    12 years 23 days ago
    Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
    Download  www.cs.cmu.edu
    The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
    Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...
    claim paper
    Read More »
    SODA
    2012
    ACM
    185views Algorithms» more  SODA 2012»
    Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
    12 years 23 days ago
    Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
    Download  cs.uwaterloo.ca
    Timothy M. Chan, Elyot Grant, Jochen Könemann...
    claim paper
    Read More »
    « first‹ previous12345next ›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.