Sciweavers

    STOC
    2003
    ACM
    116views Algorithms» more  STOC 2003»
    New lattice based cryptographic constructions
    14 years 5 months ago
    New lattice based cryptographic constructions
    Download  www.cs.tau.ac.il
    We introduce the use of Fourier analysis on lattices as an integral part of a lattice based construction. The tools we develop provide an elegant description of certain Gaussian d...
    Oded Regev
    claim paper
    Read More »
    STOC
    2003
    ACM
    85views Algorithms» more  STOC 2003»
    Derandomizing polynomial identity tests means proving circuit lower bounds
    14 years 5 months ago
    Derandomizing polynomial identity tests means proving circuit lower bounds
    Download  www.cs.montana.edu
    Valentine Kabanets, Russell Impagliazzo
    claim paper
    Read More »
    STOC
    2003
    ACM
    109views Algorithms» more  STOC 2003»
    A new multilayered PCP and the hardness of hypergraph vertex cover
    14 years 5 months ago
    A new multilayered PCP and the hardness of hypergraph vertex cover
    Download  reference.kfupm.edu.sa
    Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
    Irit Dinur, Venkatesan Guruswami, Subhash Khot, Od...
    claim paper
    Read More »
    STOC
    2003
    ACM
    140views Algorithms» more  STOC 2003»
    Approximation schemes for clustering problems
    15 years 22 days ago
    Approximation schemes for clustering problems
    Download  www.cse.iitd.ernet.in
    We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
    Wenceslas Fernandez de la Vega, Marek Karpinski, C...
    claim paper
    Read More »
    STOC
    2003
    ACM
    193views Algorithms» more  STOC 2003»
    Space efficient dynamic stabbing with fast queries
    15 years 22 days ago
    Space efficient dynamic stabbing with fast queries
    Download  www.cs.ust.hk
    In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
    Mikkel Thorup
    claim paper
    Read More »
    STOC
    2003
    ACM
    142views Algorithms» more  STOC 2003»
    Optimal probabilistic fingerprint codes
    15 years 22 days ago
    Optimal probabilistic fingerprint codes
    Download  www.cs.utsa.edu
    We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
    Gábor Tardos
    claim paper
    Read More »
    STOC
    2003
    ACM
    95views Algorithms» more  STOC 2003»
    On the power of quantum fingerprinting
    15 years 22 days ago
    On the power of quantum fingerprinting
    Download  www.cs.princeton.edu
    Andrew Chi-Chih Ya
    claim paper
    Read More »
    STOC
    2003
    ACM
    92views Algorithms» more  STOC 2003»
    Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
    15 years 22 days ago
    Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
    Download  pages.cpsc.ucalgary.ca
    Martin Sauerhoff, Philipp Woelfel
    claim paper
    Read More »
    STOC
    2003
    ACM
    114views Algorithms» more  STOC 2003»
    Approximation algorithms for hierarchical location problems
    15 years 22 days ago
    Approximation algorithms for hierarchical location problems
    Download  www.cs.utexas.edu
    C. Greg Plaxton
    claim paper
    Read More »
    STOC
    2003
    ACM
    178views Algorithms» more  STOC 2003»
    Uniform hashing in constant time and linear space
    15 years 22 days ago
    Uniform hashing in constant time and linear space
    Download  www.it-c.dk
    Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
    Anna Östlin, Rasmus Pagh
    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.