Sciweavers

    2446 search results - page 63 / 490
    » Choiceless Polynomial Time
    Sort
    View
    FOCS
    1996
    IEEE
    72views Theoretical Computer Science» more  FOCS 1996»
    A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions
    13 years 11 months ago
    A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions
    Download  www.math.cmu.edu
    Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh V...
    claim paper
    Read More »
    ICPP
    1996
    IEEE
    189views Distributed And Parallel Com...» more  ICPP 1996»
    Polynomial-Time Nested Loop Fusion with Full Parallelism
    13 years 11 months ago
    Polynomial-Time Nested Loop Fusion with Full Parallelism
    Download  www.utdallas.edu
    Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
    Edwin Hsing-Mean Sha, Chenhua Lang, Nelson L. Pass...
    claim paper
    Read More »
    CIE
    2006
    Springer
    80views Applied Computing» more  CIE 2006»
    Enumeration Reducibility with Polynomial Time Bounds
    13 years 11 months ago
    Enumeration Reducibility with Polynomial Time Bounds
    Download  www.cs.swan.ac.uk
    Charles M. Harris
    claim paper
    Read More »
    COCOON
    2006
    Springer
    108views Combinatorics» more  COCOON 2006»
    A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
    13 years 11 months ago
    A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
    Download  i11www.iti.uni-karlsruhe.de
    We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
    Marc Benkert, Joachim Gudmundsson, Christian Knaue...
    claim paper
    Read More »
    FOCS
    1995
    IEEE
    101views Theoretical Computer Science» more  FOCS 1995»
    Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time
    13 years 11 months ago
    Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time
    Download  eprints.iisc.ernet.in
    C. R. Subramanian
    claim paper
    Read More »
    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.