| 書目名稱 | Combinatorial Pattern Matching |
| 副標題 | 13th Annual Symposiu |
| 編輯 | Alberto Apostolico,Masayuki Takeda |
| 視頻video | http://file.papertrans.cn/230/229991/229991.mp4 |
| 概述 | Includes supplementary material: |
| 叢書名稱 | Lecture Notes in Computer Science |
| 圖書封面 |  |
| 描述 | 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 tha |
| 出版日期 | Conference proceedings 2002 |
| 關鍵詞 | Graph; Matching; computer; data compression; information; multimedia; pattern recognition; regular expressi |
| 版次 | 1 |
| doi | https://doi.org/10.1007/3-540-45452-7 |
| isbn_softcover | 978-3-540-43862-5 |
| isbn_ebook | 978-3-540-45452-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag Berlin Heidelberg 2002 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-2-2 03:43
發(fā)表于 2025-3-21 17:47:00
