Sciweavers

    242 search results - page 1 / 49
    » Local Algorithms for Approximate Inference in Minor-Excluded...
    Sort
    View
    NIPS
    2007
    138views Information Technology» more  NIPS 2007»
    Local Algorithms for Approximate Inference in Minor-Excluded Graphs
    13 years 6 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 »
    ADHOCNOW
    2008
    Springer
    163views Computer Networks» more  ADHOCNOW 2008»
    Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs
    13 years 11 months ago
    Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs
    Download  people.scs.carleton.ca
    We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
    Andreas Wiese, Evangelos Kranakis
    claim paper
    Read More »
    IJAR
    2008
    167views more  IJAR 2008»
    Approximate algorithms for credal networks with binary variables
    13 years 4 months ago
    Approximate algorithms for credal networks with binary variables
    Download  www.poli.usp.br
    This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...
    Jaime Shinsuke Ide, Fabio Gagliardi Cozman
    claim paper
    Read More »
    EACL
    2009
    ACL Anthology
    108views Natural Language Processing» more  EACL 2009»
    Cube Summing, Approximate Inference with Non-Local Features, and Dynamic Programming without Semirings
    14 years 5 months ago
    Cube Summing, Approximate Inference with Non-Local Features, and Dynamic Programming without Semirings
    Download  www.cs.cmu.edu
    We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-loc...
    Kevin Gimpel, Noah A. Smith
    claim paper
    Read More »
    CISS
    2007
    IEEE
    159views Information Technology» more  CISS 2007»
    Energy Efficient Routing for Statistical Inference of Markov Random Fields
    13 years 8 months ago
    Energy Efficient Routing for Statistical Inference of Markov Random Fields
    Download  acsp.ece.cornell.edu
    The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
    Animashree Anandkumar, Lang Tong, Ananthram Swami
    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.