Sciweavers

    STOC
    1999
    ACM
    101views Algorithms» more  STOC 1999»
    Sublinear Time Algorithms for Metric Space Problems
    14 years 9 months ago
    Sublinear Time Algorithms for Metric Space Problems
    Download  www.wisdom.weizmann.ac.il
    Piotr Indyk
    claim paper
    Read More »
    STOC
    1999
    ACM
    87views Algorithms» more  STOC 1999»
    Scheduling Data Transfers in a Network and the Set Scheduling Problem
    14 years 9 months ago
    Scheduling Data Transfers in a Network and the Set Scheduling Problem
    Download  www.hpl.hp.com
    Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...
    claim paper
    Read More »
    STOC
    1999
    ACM
    85views Algorithms» more  STOC 1999»
    A Theorem on Sensitivity and Applications in Private Computation
    14 years 9 months ago
    A Theorem on Sensitivity and Applications in Private Computation
    Download  www.cs.technion.ac.il
    In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
    Anna Gál, Adi Rosén
    claim paper
    Read More »
    STOC
    1999
    ACM
    104views Algorithms» more  STOC 1999»
    Fast Approximate PCPs
    14 years 9 months ago
    Fast Approximate PCPs
    Download  www.cs.princeton.edu
    We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
    Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
    claim paper
    Read More »
    STOC
    1999
    ACM
    106views Algorithms» more  STOC 1999»
    Scheduling in the Dark
    14 years 9 months ago
    Scheduling in the Dark
    Download  www.cse.yorku.ca
    We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when ...
    Jeff Edmonds
    claim paper
    Read More »
    STOC
    1999
    ACM
    81views Algorithms» more  STOC 1999»
    PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability
    14 years 9 months ago
    PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability
    Download  www.cs.huji.ac.il
    This paper strengthens the low-error PCP characterization of NP, coming closer to the upper limit of the BGLR conjecture. Consider the task of verifying a witness for the membersh...
    Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, S...
    claim paper
    Read More »
    STOC
    1999
    ACM
    75views Algorithms» more  STOC 1999»
    Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes
    14 years 9 months ago
    Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes
    Download  www.math.ucsd.edu
    Samuel R. Buss, Dima Grigoriev, Russell Impagliazz...
    claim paper
    Read More »
    STOC
    1999
    ACM
    74views Algorithms» more  STOC 1999»
    Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces
    14 years 9 months ago
    Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces
    Download  www.cs.ucla.edu
    Allan Borodin, Rafail Ostrovsky, Yuval Rabani
    claim paper
    Read More »
    STOC
    1999
    ACM
    80views Algorithms» more  STOC 1999»
    Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems
    14 years 9 months ago
    Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems
    Download  www.cs.ucla.edu
    Allan Borodin, Rafail Ostrovsky, Yuval Rabani
    claim paper
    Read More »
    STOC
    1999
    ACM
    176views Algorithms» more  STOC 1999»
    On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
    14 years 9 months ago
    On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
    Download  www.csie.nuk.edu.tw
    Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
    Johannes Blömer, Jean-Pierre Seifert
    claim paper
    Read More »
    « first‹ previous…328329330331332333334335336…next ›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-2025, USA.