Cantitate/Preț
Produs

Combinatorial Pattern Matching: 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011, Proceedings: Lecture Notes in Computer Science, cartea 6661

Editat de Raffaele Giancarlo, Giovanni Manzini
en Limba Engleză Paperback – 16 iun 2011
This book constitutes the refereed proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011, held in Palermi, Italy, in June 2011.
The 36 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 70 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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33833 lei

Preț vechi: 42292 lei
-20% Nou

Puncte Express: 507

Preț estimativ în valută:
6477 6661$ 5373£

Carte disponibilă

Livrare economică 27 ianuarie-10 februarie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642214578
ISBN-10: 3642214576
Pagini: 496
Ilustrații: XV, 480 p. 125 illus., 10 illus. in color.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.74 kg
Ediția:2011
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Textul de pe ultima copertă

This book constitutes the refereed proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011, held in Palermi, Italy, in June 2011.
The 36 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 70 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.

Caracteristici

Fast track conference proceedings Unique visibility State of the art research