Sciweavers

    7 search results - page 1 / 2
    » Max cut and the smallest eigenvalue
    Sort
    View
    STOC
    2009
    ACM
    106views Algorithms» more  STOC 2009»
    Max cut and the smallest eigenvalue
    14 years 5 months ago
    Max cut and the smallest eigenvalue
    Download  www.cs.berkeley.edu
    We describe a new approximation algorithm for Max Cut. Our algorithm runs in ~O(n2 ) time, where n is the number
    Luca Trevisan
    claim paper
    Read More »
    ENDM
    2008
    82views more  ENDM 2008»
    Finding Folkman Numbers via MAX CUT Problem
    13 years 4 months ago
    Finding Folkman Numbers via MAX CUT Problem
    Download  www.math.cmu.edu
    In this note we report on our recent work, still in progress, regarding Folkman numbers. Let f(2, 3, 4) denote the smallest integer n such that there exists a K4
    Andrzej Dudek, Vojtech Rödl
    claim paper
    Read More »
    NETWORKING
    2008
    89views Computer Networks» more  NETWORKING 2008»
    On the Robustness of Complex Networks by Using the Algebraic Connectivity
    13 years 6 months ago
    On the Robustness of Complex Networks by Using the Algebraic Connectivity
    Download  dutetvg.et.tudelft.nl
    The second smallest eigenvalue of the Laplacian matrix, also known as the algebraic connectivity, plays a special role for the robustness of complex networks since it measures the ...
    A. Jamakovic, Piet Van Mieghem
    claim paper
    Read More »
    CORR
    2011
    Springer
    215views Education» more  CORR 2011»
    Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
    12 years 8 months ago
    Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
    Download  www.cs.cmu.edu
    We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
    Venkatesan Guruswami, Ali Kemal Sinop
    claim paper
    Read More »
    ACCV
    2007
    Springer
    254views Computer Vision» more  ACCV 2007»
    Efficiently Solving the Fractional Trust Region Problem
    13 years 8 months ago
    Efficiently Solving the Fractional Trust Region Problem
    Download  www.maths.lth.se
    Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...
    Anders P. Eriksson, Carl Olsson, Fredrik Kahl
    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.