Sciweavers

    STOC
    1996
    ACM
    100views Algorithms» more  STOC 1996»
    The Linear-Array Conjecture in Communication Complexity is False
    14 years 3 months ago
    The Linear-Array Conjecture in Communication Complexity is False
    Download  www.cs.ucla.edu
    A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
    Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
    claim paper
    Read More »
    STOC
    1996
    ACM
    132views Algorithms» more  STOC 1996»
    Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
    14 years 3 months ago
    Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
    Download  alexandria.tue.nl
    We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
    Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woegi...
    claim paper
    Read More »
    STOC
    1996
    ACM
    104views Algorithms» more  STOC 1996»
    On the Boosting Ability of Top-Down Decision Tree Learning Algorithms
    14 years 3 months ago
    On the Boosting Ability of Top-Down Decision Tree Learning Algorithms
    Download  www.cis.upenn.edu
    Michael J. Kearns, Yishay Mansour
    claim paper
    Read More »
    STOC
    1996
    ACM
    115views Algorithms» more  STOC 1996»
    Minimum Cuts in Near-Linear Time
    14 years 3 months ago
    Minimum Cuts in Near-Linear Time
    Download  www.cs.ust.hk
    We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
    David R. Karger
    claim paper
    Read More »
    STOC
    1996
    ACM
    197views Algorithms» more  STOC 1996»
    Computing Betti Numbers via Combinatorial Laplacians
    14 years 3 months ago
    Computing Betti Numbers via Combinatorial Laplacians
    Download  www.math.ubc.ca
    We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
    Joel Friedman
    claim paper
    Read More »
    STOC
    1996
    ACM
    101views Algorithms» more  STOC 1996»
    Efficient Algorithms for Inverting Evolution
    14 years 3 months ago
    Efficient Algorithms for Inverting Evolution
    Download  www.cs.rutgers.edu
    Martin Farach, Sampath Kannan
    claim paper
    Read More »
    STOC
    1996
    ACM
    118views Algorithms» more  STOC 1996»
    Towards an Analysis of Local Optimization Algorithms
    14 years 3 months ago
    Towards an Analysis of Local Optimization Algorithms
    Download  www.ait.gr
    We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
    Tassos Dimitriou, Russell Impagliazzo
    claim paper
    Read More »
    STOC
    1996
    ACM
    97views Algorithms» more  STOC 1996»
    Deterministic Restrictions in Circuit Complexity
    14 years 3 months ago
    Deterministic Restrictions in Circuit Complexity
    Download  www.tcs.tifr.res.in
    We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
    Shiva Chaudhuri, Jaikumar Radhakrishnan
    claim paper
    Read More »
    STOC
    1996
    ACM
    185views Algorithms» more  STOC 1996»
    Adaptively Secure Multi-Party Computation
    14 years 3 months ago
    Adaptively Secure Multi-Party Computation
    Download  publications.csail.mit.edu
    A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
    Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
    claim paper
    Read More »
    STOC
    1996
    ACM
    95views Algorithms» more  STOC 1996»
    Pushing Disks Together - The Continuous-Motion Case
    14 years 3 months ago
    Pushing Disks Together - The Continuous-Motion Case
    Download  www.cs.ucla.edu
    If disks are moved so that each center
    Marshall W. Bern, Amit Sahai
    claim paper
    Read More »
    « first‹ previous…304305306307308309310311312…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-2024, USA.