- Weitere Titel
-
Markoff fields as resource for image processing
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Deutsch
- Anmerkungen
-
Aachen, RWTH Aachen, Diplomarbeit, 1994
- Klassifikation
-
Informatik
- Schlagwort
-
Bildverarbeitung
Pixel
Zufälliges Feld
- Ereignis
-
Veröffentlichung
- (wo)
-
Konstanz
- (wer)
-
Bibliothek der Universität Konstanz
- (wann)
-
2008
- Urheber
- URN
-
urn:nbn:de:bsz:352-opus-72322
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:51 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Brandes, Ulrik
- Bibliothek der Universität Konstanz
Entstanden
- 2008
Ähnliche Objekte (12)
Layout of graph visualizations
Layout of Graph Visualizations
Network analysis : methodological foundations
Hunting Down Graph B
Network positions
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
A Faster Algorithm for Betweenness Centrality
Eager st-Ordering
Graph drawing by classical multidimensional scaling : new perspectives
Optimal Leaf Ordering of Complete Binary Trees
Special Issue with Selected Papers from the 18th International Symposium on Graph Drawing, GD 2010 : Guest Editors' Foreword
Orthogonal-Ordering Constraints are Tough
Layout of graph visualizations
Layout of Graph Visualizations
Network analysis : methodological foundations
Hunting Down Graph B
Network positions
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
A Faster Algorithm for Betweenness Centrality
Eager st-Ordering
Graph drawing by classical multidimensional scaling : new perspectives
Optimal Leaf Ordering of Complete Binary Trees
Special Issue with Selected Papers from the 18th International Symposium on Graph Drawing, GD 2010 : Guest Editors' Foreword
Orthogonal-Ordering Constraints are Tough
Layout of graph visualizations
Layout of Graph Visualizations
Network analysis : methodological foundations
Hunting Down Graph B
Network positions
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
A Faster Algorithm for Betweenness Centrality
Eager st-Ordering
Graph drawing by classical multidimensional scaling : new perspectives
Optimal Leaf Ordering of Complete Binary Trees
Special Issue with Selected Papers from the 18th International Symposium on Graph Drawing, GD 2010 : Guest Editors' Foreword