Sciweavers

1830 search results - page 64 / 366
» Workshop on Graph Computation Models
Sort
View
MICCAI
2010
Springer
15 years 2 months ago
Non-parametric Iterative Model Constraint Graph min-cut for Automatic Kidney Segmentation
We present a new non-parametric model constraint graph min-cut algorithm for automatic kidney segmentation in CT images. The segmentation is formulated as a maximum a-posteriori es...
Moti Freiman, A. Kronman, S. J. Esses, Leo Joskowi...
ISCAPDCS
2003
15 years 5 months ago
Optimal Graph Transformation Assuming Alternate Scheduling Models
Many computation-intensive iterative or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graph...
Timothy W. O'Neil
DAC
2005
ACM
16 years 5 months ago
Minimising buffer requirements of synchronous dataflow graphs with model checking
Signal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little ...
Marc Geilen, Twan Basten, Sander Stuijk
CPE
1994
Springer
170views Hardware» more  CPE 1994»
15 years 8 months ago
Automatic Scalability Analysis of Parallel Programs Based on Modeling Techniques
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
ACSAC
2009
IEEE
15 years 11 months ago
Modeling Modern Network Attacks and Countermeasures Using Attack Graphs
Abstract—By accurately measuring risk for enterprise networks, attack graphs allow network defenders to understand the most critical threats and select the most effective counter...
Kyle Ingols, Matthew Chu, Richard Lippmann, Seth E...