Sciweavers

    22 search results - page 2 / 5
    » An exact algorithm for MAX-CUT in sparse graphs
    Sort
    View
    COLING
    2008
    119views Computational Linguistics» more  COLING 2008»
    Exact Inference for Multi-label Classification using Sparse Graphical Models
    13 years 9 months ago
    Exact Inference for Multi-label Classification using Sparse Graphical Models
    Download  www-tsujii.is.s.u-tokyo.ac.jp
    This paper describes a parameter estimation method for multi-label classification that does not rely on approximate inference. It is known that multi-label classification involvin...
    Yusuke Miyao, Jun-ichi Tsujii
    claim paper
    Read More »
    APPROX
    2004
    Springer
    179views Algorithms» more  APPROX 2004»
    Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
    14 years 26 days ago
    Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
    Download  www.mit.edu
    ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
    David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
    claim paper
    Read More »
    JMLR
    2012
    194views Programming Languages» more  JMLR 2012»
    Exact Covariance Thresholding into Connected Components for Large-Scale Graphical Lasso
    11 years 10 months ago
    Exact Covariance Thresholding into Connected Components for Large-Scale Graphical Lasso
    Download  www.stanford.edu
    We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter λ. Suppose the sample covariance graph formed by thresholding th...
    Rahul Mazumder, Trevor Hastie
    claim paper
    Read More »
    SIGECOM
    2009
    ACM
    137views ECommerce» more  SIGECOM 2009»
    An exact almost optimal algorithm for target set selection in social networks
    14 years 2 months ago
    An exact almost optimal algorithm for target set selection in social networks
    Download  www.ii.uib.no
    The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
    Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
    claim paper
    Read More »
    SMA
    2009
    ACM
    134views Solid Modeling» more  SMA 2009»
    Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses
    14 years 2 months ago
    Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses
    Download  cgi.di.uoa.gr
    We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
    Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
    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.