L’édition demandée n’est plus disponible, nous vous proposons la dernière édition.
Combinatorial Pattern Matching, 2012 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012, Proceedings Theoretical Computer Science and General Issues Series
Coordonnateurs : Kärkkäinen Juha, Stoye Jens
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.
Fast track conference proceedings
Unique visibility
State of the art research
Date de parution : 06-2012
Ouvrage de 454 p.
15.5x23.5 cm
Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).
Prix indicatif 52,74 €
Ajouter au panier