Sciweavers

1407 search results - page 136 / 282
» Join-Graph Propagation Algorithms
Sort
View
98
Voted
ACIVS
2008
Springer
15 years 4 months ago
An Efficient Hardware Architecture without Line Memories for Morphological Image Processing
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
97
Voted
DAC
2005
ACM
15 years 4 months ago
On the need for statistical timing analysis
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
EMNLP
2008
15 years 3 months ago
Weakly-Supervised Acquisition of Labeled Class Instances using Graph Random Walks
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...
122
Voted
BILDMED
2006
169views Algorithms» more  BILDMED 2006»
15 years 3 months ago
Segmentation of the Vascular Tree in CT Data Using Implicit Active Contours
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...
FLAIRS
2001
15 years 3 months ago
Maximal Prime Subgraph Decomposition of Bayesian Networks
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