Combinatorial Pattern Matching: 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012, Proceedings (Lecture Notes in Computer Science, 7354). Dieser Artikel ist nicht verfügbar.
Sprache: Englisch
Verlag: Springer, 2012
- Softcover
- Neu

Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in mit 5 Sternen
Verkäufer:in bei ZVAB seit 25. März 2015
Nicht verfügbar
Softcover
Zustand: Neu
EUR 68,95
Artikelbeschreibung des Verkäufers
In English.
Bestandsnummer des Verkäufers ria9783642312649_new
- Titel
- Combinatorial Pattern Matching: 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012, Proceedings (Lecture Notes in Computer Science, 7354)
- Verlag
- Springer
- Erscheinungsjahr
- 2012
- Zustand
- New
- Einband
- Softcover
- Sprache
- Englisch
- ISBN-10
- 3642312640
- ISBN-13
- 9783642312649
- Artikelgewicht
- 775 Gramm
This book constitutes the refereed proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching, C.P.M. 2012, held in Helsinki, Finland, in July 2012. The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition.
„Inhaltsangabe“ gehört möglicherweise zu einer anderen Auflage dieses Titels.
Von der hinteren Coverseite
This book constitutes the refereed proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012, held in Helsinki, Finalnd, in July 2012.
The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition.
The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition.
„Über diesen Titel“ gehört möglicherweise zu einer anderen Auflage dieses Titels.