Sciweavers

    STOC
    1994
    ACM
    71views Algorithms» more  STOC 1994»
    On lazy randomized incremental construction
    13 years 10 months ago
    On lazy randomized incremental construction
    Download  igitur-archive.library.uu.nl
    Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf
    claim paper
    Read More »
    STOC
    1994
    ACM
    128views Algorithms» more  STOC 1994»
    Weakly learning DNF and characterizing statistical query learning using Fourier analysis
    13 years 10 months ago
    Weakly learning DNF and characterizing statistical query learning using Fourier analysis
    Download  www.mathcs.duq.edu
    We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
    Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
    claim paper
    Read More »
    STOC
    1994
    ACM
    91views Algorithms» more  STOC 1994»
    The minimum latency problem
    13 years 10 months ago
    The minimum latency problem
    Download  www.ri.cmu.edu
    Avrim Blum, Prasad Chalasani, Don Coppersmith, Wil...
    claim paper
    Read More »
    STOC
    1994
    ACM
    94views Algorithms» more  STOC 1994»
    Balanced allocations (extended abstract)
    13 years 10 months ago
    Balanced allocations (extended abstract)
    Download  www.cs.brown.edu
    Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli ...
    claim paper
    Read More »
    STOC
    1994
    ACM
    80views Algorithms» more  STOC 1994»
    Simulating quadratic dynamical systems is PSPACE-complete (preliminary version)
    13 years 10 months ago
    Simulating quadratic dynamical systems is PSPACE-complete (preliminary version)
    Download  www.cs.technion.ac.il
    Sanjeev Arora, Yuval Rabani, Umesh V. Vazirani
    claim paper
    Read More »
    STOC
    1994
    ACM
    125views Algorithms» more  STOC 1994»
    A spectral technique for coloring random 3-colorable graphs (preliminary version)
    13 years 10 months ago
    A spectral technique for coloring random 3-colorable graphs (preliminary version)
    Download  www.cs.tau.ac.il
    Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
    Noga Alon, Nabil Kahale
    claim paper
    Read More »
    « first‹ previous12
    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.