Sciweavers

2314 search results - page 198 / 463
» Minimal Partitions of a Graph
Sort
View
ICIP
2008
IEEE
16 years 5 months ago
Graph cut segmentation of neuronal structures from transmission electron micrographs
In many neurophysiological studies, understanding the neuronal circuitry of the brain requires detailed 3D models of the nerve cells and their synapses. Typically, researchers bui...
Nhat Vu, B. S. Manjunath
DAC
2007
ACM
16 years 5 months ago
Efficient Computation of Buffer Capacities for Cyclo-Static Dataflow Graphs
A key step in the design of cyclo-static real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure, which means that tasks...
Maarten Wiggers, Marco Bekooij, Gerard J. M. Smit
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
NOMS
2010
IEEE
195views Communications» more  NOMS 2010»
15 years 2 months ago
Optimized network configuration parameter assignment based on graph coloring
The trend for future mobile networks is to move away from Network Elements (NEs) delivered with specially tailored configurations towards off-the-shelf products. The configurations...
Tobias Bandh, Georg Carle, Henning Sanneck, Lars-C...
CVPR
2009
IEEE
16 years 11 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002