Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
EUR 32,38
Anzahl: 1 verfügbar
In den WarenkorbZustand: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In fair condition, suitable as a study copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,850grams, ISBN:0121743500.
Verlag: Academic Press. 1975., 1975
Anbieter: Antiquariaat Ovidius, Bredevoort, Niederlande
Zustand: Gebraucht / Used. Hardcover. Very good. Xv,400pp.
Anbieter: Scarthin Books ABA, ILAB., Cromford, Vereinigtes Königreich
Erstausgabe
EUR 117,19
Anzahl: 1 verfügbar
In den WarenkorbBook Hardcover. Zustand: As New. No Jacket. 1st Edition. Springer, 2007. 1st Edition . As New/No Jacket. Book still in original shrink-wrap.
Verlag: Springer Berlin Heidelberg, 2007
ISBN 10: 3642087647 ISBN 13: 9783642087646
Sprache: Englisch
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 154,05
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 276 pages. 9.25x6.10x0.63 inches. In Stock.
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: Neu. Applied Graph Theory in Computer Vision and Pattern Recognition | Abraham Kandel (u. a.) | Taschenbuch | x | Englisch | 2010 | Springer Vieweg | EAN 9783642087646 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Verlag: Springer Berlin Heidelberg, 2007
ISBN 10: 3540680195 ISBN 13: 9783540680192
Sprache: Englisch
Anbieter: moluna, Greven, Deutschland
EUR 118,64
Anzahl: Mehr als 20 verfügbar
In den WarenkorbGebunden. Zustand: New. Will serve as a foundation for a variety of useful applications of the graph theory to computer vision, pattern recognition, and related areasCovers a representative set of novel graph-theoretic methods for complex computer vision and pattern reco.
Verlag: Springer Berlin Heidelberg, 2010
ISBN 10: 3642087647 ISBN 13: 9783642087646
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Graph theory has strong historical roots in mathematics, especially in topology. Its birth is usually associated with the 'four-color problem' posed by Francis Guthrie 1 in 1852, but its real origin probably goes back to the Seven Bridges of Konigsber g 2 problem proved by Leonhard Euler in 1736. A computational solution to these two completely different problems could be found after each problem was abstracted to the level of a graph model while ignoring such irrelevant details as country shapes or cross-river distances. In general, a graph is a nonempty set of points (vertices) and the most basic information preserved by any graph structure refers to adjacency relationships (edges) between some pairs of points. In the simplest graphs, edges do not have to hold any attributes, except their endpoints, but in more sophisticated graph structures, edges can be associated with a direction or assigned a label. Graph vertices can be labeled as well. A graph can be represented graphically as a drawing (vertex=dot,edge=arc),but,aslongaseverypairofadjacentpointsstaysconnected by the same edge, the graph vertices can be moved around on a drawing without changing the underlying graph structure. The expressive power of the graph models placing a special emphasis on c- nectivity between objects has made them the models of choice in chemistry, physics, biology, and other elds.
Verlag: Springer, Berlin, Springer Berlin Heidelberg, Springer, 2007
ISBN 10: 3540680195 ISBN 13: 9783540680192
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Graph theory has strong historical roots in mathematics, especially in topology. Its birth is usually associated with the 'four-color problem' posed by Francis Guthrie 1 in 1852, but its real origin probably goes back to the Seven Bridges of Konigsber g 2 problem proved by Leonhard Euler in 1736. A computational solution to these two completely different problems could be found after each problem was abstracted to the level of a graph model while ignoring such irrelevant details as country shapes or cross-river distances. In general, a graph is a nonempty set of points (vertices) and the most basic information preserved by any graph structure refers to adjacency relationships (edges) between some pairs of points. In the simplest graphs, edges do not have to hold any attributes, except their endpoints, but in more sophisticated graph structures, edges can be associated with a direction or assigned a label. Graph vertices can be labeled as well. A graph can be represented graphically as a drawing (vertex=dot,edge=arc),but,aslongaseverypairofadjacentpointsstaysconnected by the same edge, the graph vertices can be moved around on a drawing without changing the underlying graph structure. The expressive power of the graph models placing a special emphasis on c- nectivity between objects has made them the models of choice in chemistry, physics, biology, and other elds.