Atjaunināt sīkdatņu piekrišanu

Graph-Based Representations in Pattern Recognition: 12th IAPR-TC-15 International Workshop, GbRPR 2019, Tours, France, June 1921, 2019, Proceedings 2019 ed. [Mīkstie vāki]

Edited by , Edited by , Edited by
  • Formāts: Paperback / softback, 247 pages, height x width: 235x155 mm, weight: 454 g, 74 Illustrations, color; 18 Illustrations, black and white; X, 247 p. 92 illus., 74 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 11510
  • Izdošanas datums: 16-May-2019
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 3030200809
  • ISBN-13: 9783030200800
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 247 pages, height x width: 235x155 mm, weight: 454 g, 74 Illustrations, color; 18 Illustrations, black and white; X, 247 p. 92 illus., 74 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 11510
  • Izdošanas datums: 16-May-2019
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 3030200809
  • ISBN-13: 9783030200800
This book constitutes the refereed proceedings of the 12th IAPR-TC-15 International Workshop on Graph-Based Representation in Pattern Recognition, GbRPR 2019, held in Tours, France, in June 2019.

The 22 full papers included in this volume together with an invited talk were carefully reviewed and selected from 28 submissions. The papers discuss research results and applications at the intersection of pattern recognition, image analysis, and graph theory. They cover topics such as graph edit distance, graph matching, machine learning for graph problems, network and graph embedding, spectral graph problems, and parallel algorithms for graph problems.