Sciweavers

    330 search results - page 28 / 66
    » Compressing Bounded Degree Graphs
    Sort
    View
    NIPS
    2007
    138views Information Technology» more  NIPS 2007»
    Local Algorithms for Approximate Inference in Minor-Excluded Graphs
    14 years 11 months ago
    Local Algorithms for Approximate Inference in Minor-Excluded Graphs
    Download  books.nips.cc
    We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
    Kyomin Jung, Devavrat Shah
    claim paper
    Read More »
    SODA
    2004
    ACM
    160views Algorithms» more  SODA 2004»
    On colorings of squares of outerplanar graphs
    14 years 11 months ago
    On colorings of squares of outerplanar graphs
    Download  math.gmu.edu
    We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
    Geir Agnarsson, Magnús M. Halldórsso...
    claim paper
    Read More »
    JGT
    2008
    97views more  JGT 2008»
    On the oriented chromatic index of oriented graphs
    14 years 9 months ago
    On the oriented chromatic index of oriented graphs
    Download  www.lirmm.fr
    A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
    Pascal Ochem, Alexandre Pinlou, Eric Sopena
    claim paper
    Read More »
    81
    Voted
    EJC
    2008
    117views Information Technology» more  EJC 2008»
    Grad and classes with bounded expansion II. Algorithmic aspects
    14 years 9 months ago
    Grad and classes with bounded expansion II. Algorithmic aspects
    Download  iti.mff.cuni.cz
    Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
    Jaroslav Nesetril, Patrice Ossona de Mendez
    claim paper
    Read More »
    TPDS
    2008
    136views more  TPDS 2008»
    Data Gathering with Tunable Compression in Sensor Networks
    14 years 9 months ago
    Data Gathering with Tunable Compression in Sensor Networks
    Download  halcyon.usc.edu
    We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
    Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
    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-2025, USA.