Sciweavers

    ICS
    2010
    Tsinghua U.
    149views Distributed And Parallel Com...» more  ICS 2010»
    Circuit Lower Bounds, Help Functions, and the Remote Point Problem
    14 years 10 months ago
    Circuit Lower Bounds, Help Functions, and the Remote Point Problem
    Download  conference.itcs.tsinghua.edu.cn
    V. Arvind, Srikanth Srinivasan
    claim paper
    Read More »
    ICS
    2010
    Tsinghua U.
    134views Distributed And Parallel Com...» more  ICS 2010»
    Derandomizing Algorithms on Product Distributions and Other Applications of Order-Based Extraction
    14 years 10 months ago
    Derandomizing Algorithms on Product Distributions and Other Applications of Order-Based Extraction
    Download  www2.lns.mit.edu
    Ariel Gabizon, Avinatan Hassidim
    claim paper
    Read More »
    ICS
    2010
    Tsinghua U.
    138views Distributed And Parallel Com...» more  ICS 2010»
    Global Alignment of Molecular Sequences via Ancestral State Reconstruction
    14 years 10 months ago
    Global Alignment of Molecular Sequences via Ancestral State Reconstruction
    Download  conference.itcs.tsinghua.edu.cn
    Alexandr Andoni, Constantinos Daskalakis, Avinatan...
    claim paper
    Read More »
    ICS
    2010
    Tsinghua U.
    134views Distributed And Parallel Com...» more  ICS 2010»
    Proof-Carrying Data and Hearsay Arguments from Signature Cards
    14 years 10 months ago
    Proof-Carrying Data and Hearsay Arguments from Signature Cards
    Download  people.csail.mit.edu
    : Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
    Alessandro Chiesa, Eran Tromer
    claim paper
    Read More »
    ICS
    2010
    Tsinghua U.
    143views Distributed And Parallel Com...» more  ICS 2010»
    Are Stable Instances Easy?
    14 years 10 months ago
    Are Stable Instances Easy?
    Download  www.cs.huji.ac.il
    We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
    Yonatan Bilu, Nathan Linial
    claim paper
    Read More »
    ICS
    2010
    Tsinghua U.
    199views Distributed And Parallel Com...» more  ICS 2010»
    A New Approximation Technique for Resource-Allocation Problems
    14 years 10 months ago
    A New Approximation Technique for Resource-Allocation Problems
    Download  www.cs.umd.edu
    Barna Saha, Aravind Srinivasan
    claim paper
    Read More »
    ICS
    2010
    Tsinghua U.
    135views Distributed And Parallel Com...» more  ICS 2010»
    On the Construction of One-Way Functions from Average Case Hardness
    14 years 10 months ago
    On the Construction of One-Way Functions from Average Case Hardness
    Download  eccc.hpi-web.de
    In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
    Noam Livne
    claim paper
    Read More »
    ICS
    2010
    Tsinghua U.
    153views Distributed And Parallel Com...» more  ICS 2010»
    Cryptographic Complexity Classes and Computational Intractability Assumptions
    14 years 10 months ago
    Cryptographic Complexity Classes and Computational Intractability Assumptions
    Download  www.cs.umt.edu
    Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek
    claim paper
    Read More »
    ICS
    2010
    Tsinghua U.
    123views Distributed And Parallel Com...» more  ICS 2010»
    Hard Instances for Satisfiability and Quasi-one-way Functions
    14 years 10 months ago
    Hard Instances for Satisfiability and Quasi-one-way Functions
    Download  conference.itcs.tsinghua.edu.cn
    Andrej Bogdanov, Kunal Talwar, Andrew Wan
    claim paper
    Read More »
    ICS
    2010
    Tsinghua U.
    218views Distributed And Parallel Com...» more  ICS 2010»
    Distribution-Specific Agnostic Boosting
    14 years 10 months ago
    Distribution-Specific Agnostic Boosting
    Download  www.cs.cmu.edu
    We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
    Vitaly Feldman
    claim paper
    Read More »
    « first‹ previous123456next ›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.