Sciweavers

    46 search results - page 3 / 10
    » Maximizing Non-Monotone Submodular Functions
    Sort
    View
    CORR
    2010
    Springer
    111views Education» more  CORR 2010»
    Submodular Maximization by Simulated Annealing
    13 years 5 months ago
    Submodular Maximization by Simulated Annealing
    Download  theory.stanford.edu
    We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
    Shayan Oveis Gharan, Jan Vondrák
    claim paper
    Read More »
    STOC
    2009
    ACM
    163views Algorithms» more  STOC 2009»
    Non-monotone submodular maximization under matroid and knapsack constraints
    14 years 6 months ago
    Non-monotone submodular maximization under matroid and knapsack constraints
    Download  www.andrew.cmu.edu
    Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
    Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
    claim paper
    Read More »
    ICCV
    2011
    IEEE
    206views Computer Vision» more  ICCV 2011»
    Distributed Cosegmentation via Submodular Optimization on Anisotropic Diffusion
    12 years 5 months ago
    Distributed Cosegmentation via Submodular Optimization on Anisotropic Diffusion
    Download  www.cs.cmu.edu
    The saliency of regions or objects in an image can be significantly boosted if they recur in multiple images. Leveraging this idea, cosegmentation jointly segments common regions...
    Gunhee Kim, Eric P. Xing, Li Fei-Fei, Takeo Kanade
    claim paper
    Read More »
    NIPS
    2008
    143views Information Technology» more  NIPS 2008»
    An Online Algorithm for Maximizing Submodular Functions
    13 years 7 months ago
    An Online Algorithm for Maximizing Submodular Functions
    Download  www.cs.cmu.edu
    We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...
    Matthew J. Streeter, Daniel Golovin
    claim paper
    Read More »
    IPCO
    2007
    66views Optimization» more  IPCO 2007»
    Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
    13 years 7 months ago
    Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
    Download  www.cs.uiuc.edu
    Gruia Calinescu, Chandra Chekuri, Martin Pá...
    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.