Sciweavers

    3875 search results - page 6 / 775
    » Approximation algorithms for the 0-extension problem
    Sort
    View
    ICALP
    2011
    Springer
    218views Programming Languages» more  ICALP 2011»
    A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
    14 years 1 months ago
    A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
    Download  www.cs.princeton.edu
    Shi Li
    claim paper
    Read More »
    ISAAC
    2010
    Springer
    265views Algorithms» more  ISAAC 2010»
    On the Approximability of the Maximum Interval Constrained Coloring Problem
    14 years 7 months ago
    On the Approximability of the Maximum Interval Constrained Coloring Problem
    Download  www.mpi-inf.mpg.de
    Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, ...
    claim paper
    Read More »
    ALGORITHMICA
    2011
    188views Artificial Intelligence» more  ALGORITHMICA 2011»
    Approximating Minimum-Power Degree and Connectivity Problems
    14 years 1 months ago
    Approximating Minimum-Power Degree and Connectivity Problems
    Download  www.openu.ac.il
    Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena...
    claim paper
    Read More »
    ICA
    2012
    Springer
    272views Signal Processing» more  ICA 2012»
    New Online EM Algorithms for General Hidden Markov Models. Application to the SLAM Problem
    13 years 5 months ago
    New Online EM Algorithms for General Hidden Markov Models. Application to the SLAM Problem
    Download  perso.telecom-paristech.fr
    In this contribution, new online EM algorithms are proposed to perform inference in general hidden Markov models. These algorithms update the parameter at some deterministic times ...
    Sylvain Le Corff, Gersende Fort, Eric Moulines
    claim paper
    Read More »
    FOCS
    2010
    IEEE
    149views Theoretical Computer Science» more  FOCS 2010»
    Subexponential Algorithms for Unique Games and Related Problems
    14 years 7 months ago
    Subexponential Algorithms for Unique Games and Related Problems
    Download  www.cs.princeton.edu
    We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
    Sanjeev Arora, Boaz Barak, David Steurer
    claim paper
    Read More »
    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-2025, USA.