1370 search results - page 126 / 274 » On grids in topological graphs |
158
click to vote
IWCIA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The expressiveness of a lot of image analysis algorithms depends on the question whether shape information is preserved during digitization. Most existing approaches to a...
130
click to vote
NN
2006
Springer
15 years 6 months ago
2006
Springer
- Since the discovery of the SOMs by T. Kohonen, many results have been found in order to get a better description of their behaviour. Most of them are very convincing but from a m...
146
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...
161
click to vote
GD
2008
Springer
15 years 7 months ago
2008
Springer
We present a new network diagram authoring tool, Dunnart, that provides continuous network layout. It continuously adjusts the layout in response to user interaction, while still m...
158
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We study hierachical segmentation in the framework of edgeweighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that th...