Articles liés à Combinatorial Pattern Matching: 13th Annual Symposium,...
Combinatorial Pattern Matching: 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings - Couverture souple
Synopsis
The papers contained in this volume were presented at the 13th Annual S- posium on Combinatorial Pattern Matching, held July 3-5, 2002 at the Hotel Uminonakamichi, in Fukuoka, Japan. They were selected from 37 abstracts s- mitted in response to the call for papers. In addition, there were invited lectures by Shinichi Morishita (University of Tokyo) and Hiroki Arimura (Kyushu U- versity). Combinatorial Pattern Matching (CPM) addresses issues of searching and matching strings and more complicated patterns such as trees, regular expr- sions, graphs, point sets, and arrays, in various formats. The goal is to derive n- trivial combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. On the other hand, an important goal is to analyze and pinpoint the properties and conditions under which searches cannot be performed e?ciently. Over the past decade a steady ?ow of high-quality research on this subject has changed a sparse set of isolated results into a full-?edged area of algorithmics. This area is continuing to grow even further due to the increasing demand for speed and e?ciency that stems from important applications such as the World Wide Web, computational biology, computer vision, and multimedia systems. These involve requirements for information retrieval in heterogeneous databases, data compression, and pattern recognition. The objective of the annual CPM gathering is to provide an international forum for research in combinatorial p- tern matching and related applications.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
- ÉditeurSpringer
- Date d'édition2008
- ISBN 10 3540438629
- ISBN 13 9783540438625
- ReliureBroché
- Langueanglais
- Nombre de pages298
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 48,37
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisRésultats de recherche pour Combinatorial Pattern Matching: 13th Annual Symposium,...
Image fournie par le vendeur
Combinatorial Pattern Matching
Edité par
Springer Berlin Heidelberg, 2002
ISBN 10 : 3540438629
ISBN 13 : 9783540438625
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 4890696
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings
Edité par
Springer Berlin Heidelberg, 2002
ISBN 10 : 3540438629
ISBN 13 : 9783540438625
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - The papers contained in this volume were presented at the 13th Annual S- posium on Combinatorial Pattern Matching, held July 3-5, 2002 at the Hotel Uminonakamichi, in Fukuoka, Japan. They were selected from 37 abstracts s- mitted in response to the call for papers. In addition, there were invited lectures by Shinichi Morishita (University of Tokyo) and Hiroki Arimura (Kyushu U- versity). Combinatorial Pattern Matching (CPM) addresses issues of searching and matching strings and more complicated patterns such as trees, regular expr- sions, graphs, point sets, and arrays, in various formats. The goal is to derive n- trivial combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. On the other hand, an important goal is to analyze and pinpoint the properties and conditions under which searches cannot be performed e ciently. Over the past decade a steady ow of high-quality research on this subject has changed a sparse set of isolated results into a full- edged area of algorithmics. This area is continuing to grow even further due to the increasing demand for speed and e ciency that stems from important applications such as the World Wide Web, computational biology, computer vision, and multimedia systems. These involve requirements for information retrieval in heterogeneous databases, data compression, and pattern recognition. The objective of the annual CPM gathering is to provide an international forum for research in combinatorial p- tern matching and related applications. N° de réf. du vendeur 9783540438625
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Combinatorial Pattern Matching
Edité par
Springer Berlin Heidelberg Jun 2002, 2002
ISBN 10 : 3540438629
ISBN 13 : 9783540438625
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The papers contained in this volume were presented at the 13th Annual S- posium on Combinatorial Pattern Matching, held July 3-5, 2002 at the Hotel Uminonakamichi, in Fukuoka, Japan. They were selected from 37 abstracts s- mitted in response to the call for papers. In addition, there were invited lectures by Shinichi Morishita (University of Tokyo) and Hiroki Arimura (Kyushu U- versity). Combinatorial Pattern Matching (CPM) addresses issues of searching and matching strings and more complicated patterns such as trees, regular expr- sions, graphs, point sets, and arrays, in various formats. The goal is to derive n- trivial combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. On the other hand, an important goal is to analyze and pinpoint the properties and conditions under which searches cannot be performed e ciently. Over the past decade a steady ow of high-quality research on this subject has changed a sparse set of isolated results into a full- edged area of algorithmics. This area is continuing to grow even further due to the increasing demand for speed and e ciency that stems from important applications such as the World Wide Web, computational biology, computer vision, and multimedia systems. These involve requirements for information retrieval in heterogeneous databases, data compression, and pattern recognition. The objective of the annual CPM gathering is to provide an international forum for research in combinatorial p- tern matching and related applications. 304 pp. Englisch. N° de réf. du vendeur 9783540438625
Quantité disponible : 2 disponible(s)
Image d'archives
Combinatorial Pattern Matching: 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings (Lecture Notes in Computer Science, 2373)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783540438625_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Combinatorial Pattern Matching
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 2002, 2002
ISBN 10 : 3540438629
ISBN 13 : 9783540438625
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -The papers contained in this volume were presented at the 13th Annual S- posium on Combinatorial Pattern Matching, held July 3¿5, 2002 at the Hotel Uminonakamichi, in Fukuoka, Japan. They were selected from 37 abstracts s- mitted in response to the call for papers. In addition, there were invited lectures by Shinichi Morishita (University of Tokyo) and Hiroki Arimura (Kyushu U- versity). Combinatorial Pattern Matching (CPM) addresses issues of searching and matching strings and more complicated patterns such as trees, regular expr- sions, graphs, point sets, and arrays, in various formats. The goal is to derive n- trivial combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. On the other hand, an important goal is to analyze and pinpoint the properties and conditions under which searches cannot be performed e ciently. Over the past decade a steady ow of high-quality research on this subject has changed a sparse set of isolated results into a full- edged area of algorithmics. This area is continuing to grow even further due to the increasing demand for speed and e ciency that stems from important applications such as the World Wide Web, computational biology, computer vision, and multimedia systems. These involve requirements for information retrieval in heterogeneous databases, data compression, and pattern recognition. The objective of the annual CPM gathering is to provide an international forum for research in combinatorial p- tern matching and related applications. 304 pp. Englisch. N° de réf. du vendeur 9783540438625
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Combinatorial Pattern Matching : 13th Annual Symposium, Cpm 2002, Fukuoka, Japan, July 3-5, 2002. Proceedings
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 986420-n
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Combinatorial Pattern Matching : 13th Annual Symposium, Cpm 2002, Fukuoka, Japan, July 3-5, 2002. Proceedings
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 986420-n
Quantité disponible : Plus de 20 disponibles
Image d'archives
Combinatorial Pattern Matching
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 304. N° de réf. du vendeur 263057674
Quantité disponible : 4 disponible(s)
Image d'archives
Combinatorial Pattern Matching
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Print on Demand pp. 304 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. N° de réf. du vendeur 5838805
Quantité disponible : 4 disponible(s)
Image d'archives
Combinatorial Pattern Matching
impression à la demandeVendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. PRINT ON DEMAND pp. 304. N° de réf. du vendeur 183057664
Quantité disponible : 4 disponible(s)