Combinatorial Pattern Matching: 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings (Lecture Notes in Computer Science, 2373, Band 2373) - Softcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Suchergebnisse für Combinatorial Pattern Matching: 13th Annual Symposium,...
Beispielbild für diese ISBN
Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings
Verlag:
Springer Berlin / Heidelberg, 2002
ISBN 10: 3540438629
ISBN 13: 9783540438625
Gebraucht
Softcover
Anbieter: Better World Books, Mishawaka, IN, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Bestandsnummer des Verkäufers GRP77581997
Gebraucht kaufen
EUR 49,59
Versand gratis
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Combinatorial Pattern Matching : 13th Annual Symposium, Cpm 2002, Fukuoka, Japan, July 3-5, 2002. Proceedings
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 986420-n
Neu kaufen
EUR 56,27
EUR 2,31 Versand
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Combinatorial Pattern Matching: 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings (Paperback or Softback)
Verlag:
Springer 6/19/2002, 2002
ISBN 10: 3540438629
ISBN 13: 9783540438625
Neu
Paperback or Softback
Anbieter: BargainBookStores, Grand Rapids, MI, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback or Softback. Zustand: New. Combinatorial Pattern Matching: 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings. Book. Bestandsnummer des Verkäufers BBS-9783540438625
Beispielbild für diese ISBN
Combinatorial Pattern Matching: 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings (Lecture Notes in Computer Science, 2373)
Anbieter: California Books, Miami, FL, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers I-9783540438625
Neu kaufen
EUR 61,32
Versand gratis
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Combinatorial Pattern Matching: 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings (Lecture Notes in Computer Science, 2373)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9783540438625_new
Neu kaufen
EUR 61,09
EUR 13,99 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Combinatorial Pattern Matching
Verlag:
Springer Berlin Heidelberg Jun 2002, 2002
ISBN 10: 3540438629
ISBN 13: 9783540438625
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783540438625
Neu kaufen
EUR 53,49
EUR 23,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Combinatorial Pattern Matching : 13th Annual Symposium, Cpm 2002, Fukuoka, Japan, July 3-5, 2002. Proceedings
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 986420-n
Neu kaufen
EUR 61,08
EUR 17,52 Versand
Versand von Vereinigtes Königreich nach USA
Versand von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Combinatorial Pattern Matching
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 4890696
Neu kaufen
EUR 48,37
EUR 48,99 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Combinatorial Pattern Matching
Verlag:
Springer, Springer Jun 2002, 2002
ISBN 10: 3540438629
ISBN 13: 9783540438625
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 304 pp. Englisch. Bestandsnummer des Verkäufers 9783540438625
Neu kaufen
EUR 53,49
EUR 60,00 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 1 verfügbar
Foto des Verkäufers
Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783540438625
Neu kaufen
EUR 53,49
EUR 62,32 Versand
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 1 verfügbar