Sciweavers

    SODA
    2012
    ACM
    170views Algorithms» more  SODA 2012»
    Compression via matroids: a randomized polynomial kernel for odd cycle transversal
    12 years 2 months ago
    Compression via matroids: a randomized polynomial kernel for odd cycle transversal
    Download  siam.omnibooksonline.com
    The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
    Stefan Kratsch, Magnus Wahlström
    claim paper
    Read More »
    STOC
    2005
    ACM
    101views Algorithms» more  STOC 2005»
    The round complexity of two-party random selection
    14 years 6 months ago
    The round complexity of two-party random selection
    Download  people.seas.harvard.edu
    We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
    Saurabh Sanghvi, Salil P. Vadhan
    claim paper
    Read More »
    STOC
    2005
    ACM
    143views Algorithms» more  STOC 2005»
    On strip packing With rotations
    14 years 6 months ago
    On strip packing With rotations
    Download  www.mpi-inf.mpg.de
    We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
    Klaus Jansen, Rob van Stee
    claim paper
    Read More »
    STOC
    2005
    ACM
    184views Algorithms» more  STOC 2005»
    Coresets in dynamic geometric data streams
    14 years 6 months ago
    Coresets in dynamic geometric data streams
    Download  www.frahling.de
    A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
    Gereon Frahling, Christian Sohler
    claim paper
    Read More »
    STOC
    2005
    ACM
    138views Algorithms» more  STOC 2005»
    A new strategy for querying priced information
    14 years 6 months ago
    A new strategy for querying priced information
    Download  www.cs.ust.hk
    This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
    Ferdinando Cicalese, Eduardo Sany Laber
    claim paper
    Read More »
    STOC
    2005
    ACM
    111views Algorithms» more  STOC 2005»
    Tensor decomposition and approximation schemes for constraint satisfaction problems
    15 years 22 days ago
    Tensor decomposition and approximation schemes for constraint satisfaction problems
    Download  www-math.mit.edu
    Wenceslas Fernandez de la Vega, Marek Karpinski, R...
    claim paper
    Read More »
    STOC
    2005
    ACM
    133views Algorithms» more  STOC 2005»
    An O(log n log log n) space algorithm for undirected st-connectivity
    15 years 22 days ago
    An O(log n log log n) space algorithm for undirected st-connectivity
    Download  www.math.uic.edu
    Abstract. We present a deterministic O(log n log log n) space algorithm for undirected stconnectivity. It is based on a space-efficient simulation of the deterministic EREW algorit...
    Vladimir Trifonov
    claim paper
    Read More »
    STOC
    2005
    ACM
    145views Algorithms» more  STOC 2005»
    On uniform amplification of hardness in NP
    15 years 22 days ago
    On uniform amplification of hardness in NP
    Download  www.cs.berkeley.edu
    We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...
    Luca Trevisan
    claim paper
    Read More »
    STOC
    2005
    ACM
    158views Algorithms» more  STOC 2005»
    Polynomial time quantum algorithm for the computation of the unit group of a number field
    15 years 22 days ago
    Polynomial time quantum algorithm for the computation of the unit group of a number field
    Download  www.cdc.informatik.tu-darmstadt.de
    We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
    Arthur Schmidt, Ulrich Vollmer
    claim paper
    Read More »
    STOC
    2005
    ACM
    107views Algorithms» more  STOC 2005»
    On obfuscating point functions
    15 years 22 days ago
    On obfuscating point functions
    Download  eprint.iacr.org
    We study the problem of obfuscation in the context of point functions (also known as delta functions). A point function is a Boolean function that assumes the value 1 at exactly o...
    Hoeteck Wee
    claim paper
    Read More »
    1234567next ›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.