Sciweavers

    1407 search results - page 136 / 282
    » Join-Graph Propagation Algorithms
    Sort
    View
    ACIVS
    2008
    Springer
    125views Computer Vision» more  ACIVS 2008»
    An Efficient Hardware Architecture without Line Memories for Morphological Image Processing
    13 years 11 months ago
    An Efficient Hardware Architecture without Line Memories for Morphological Image Processing
    Download  cmm.ensmp.fr
    In this paper, we present a novel hardware architecture to achieve erosion and dilation with a large structuring element. We are proposing a modification of HGW algorithm with a bl...
    Christophe Clienti, Michel Bilodeau, Serge Beucher
    claim paper
    Read More »
    DAC
    2005
    ACM
    100views Computer Architecture» more  DAC 2005»
    On the need for statistical timing analysis
    13 years 11 months ago
    On the need for statistical timing analysis
    Download  www.cecs.uci.edu
    Traditional corner analysis fails to guarantee a target yield for a given performance metric. However, recently proposed solutions, in the form of statistical timing analysis, whi...
    Farid N. Najm
    claim paper
    Read More »
    EMNLP
    2008
    123views Natural Language Processing» more  EMNLP 2008»
    Weakly-Supervised Acquisition of Labeled Class Instances using Graph Random Walks
    13 years 10 months ago
    Weakly-Supervised Acquisition of Labeled Class Instances using Graph Random Walks
    Download  www.talukdar.net
    We present a graph-based semi-supervised label propagation algorithm for acquiring opendomain labeled classes and their instances from a combination of unstructured and structured...
    Partha Pratim Talukdar, Joseph Reisinger, Marius P...
    claim paper
    Read More »
    BILDMED
    2006
    169views Algorithms» more  BILDMED 2006»
    Segmentation of the Vascular Tree in CT Data Using Implicit Active Contours
    13 years 10 months ago
    Segmentation of the Vascular Tree in CT Data Using Implicit Active Contours
    Download  wwwisg.cs.uni-magdeburg.de
    Abstract. We propose an algorithm for the segmentation of blood vessels in the kind of CT-data typical for diagnostics in a clinical environment. Due to poor quality and variance i...
    Karsten Rink, Arne-Michael Törsel, Klaus D. T...
    claim paper
    Read More »
    FLAIRS
    2001
    102views Artificial Intelligence» more  FLAIRS 2001»
    Maximal Prime Subgraph Decomposition of Bayesian Networks
    13 years 10 months ago
    Maximal Prime Subgraph Decomposition of Bayesian Networks
    Download  www.aaai.org
    A maximal prime subgraph decomposition junction tree (MPD-JT) is a useful computational structure that facilitates lazy propagation in Bayesian networks (BNs). A graphical method ...
    Kristian G. Olesen, Anders L. Madsen
    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.