Sciweavers

365 search results - page 60 / 73
» Reconfigurations in Graphs and Grids
Sort
View
VMV
2008
165views Visualization» more  VMV 2008»
13 years 11 months ago
Fast Global Labeling for Real-Time Stereo Using Multiple Plane Sweeps
This work presents a real-time, data-parallel approach for global label assignment on regular grids. The labels are selected according to a Markov random field energy with a Potts...
Christopher Zach, David Gallup, Jan-Michael Frahm,...
ICANN
2010
Springer
13 years 11 months ago
Visualising Clusters in Self-Organising Maps with Minimum Spanning Trees
Abstract. The Self-Organising Map (SOM) is a well-known neuralnetwork model that has successfully been used as a data analysis tool in many different domains. The SOM provides a to...
Rudolf Mayer, Andreas Rauber
MIAR
2010
IEEE
13 years 8 months ago
DTI Connectivity by Segmentation
Abstract. This paper proposes a new method to compute connectivity information from diffusion weighted images. It is inspired by graphbased approaches to connectivity definition,...
Marc Niethammer, Alexis Boucharin, Christopher Zac...
CDC
2010
IEEE
100views Control Systems» more  CDC 2010»
13 years 4 months ago
A resistance-based approach to consensus algorithm performance analysis
Abstract-We study the well known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. ...
Federica Garin, Enrico Lovisari, Sandro Zampieri
SIAMJO
2010
110views more  SIAMJO 2010»
13 years 4 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng