The papers contained in this volume were presented at the 12th Annual S- posium on Combinatorial Pattern Matching, held July 1{4, 2001 at the Dan Panorama Hotel in Jerusalem, Israel. They were selected from 35 abstracts s- mitted inresponse to the call for papers. In addition, there were invited lectures by Aviezri Fraenkel (Weizmann Institute of Science), Zvi Galil (Columbia), Rao Kosaraju (Johns Hopkins University), and Uzi Vishkin(Technion and U. Ma- land). This year the call for papers invited short (poster) ...
Read More
The papers contained in this volume were presented at the 12th Annual S- posium on Combinatorial Pattern Matching, held July 1{4, 2001 at the Dan Panorama Hotel in Jerusalem, Israel. They were selected from 35 abstracts s- mitted inresponse to the call for papers. In addition, there were invited lectures by Aviezri Fraenkel (Weizmann Institute of Science), Zvi Galil (Columbia), Rao Kosaraju (Johns Hopkins University), and Uzi Vishkin(Technion and U. Ma- land). This year the call for papers invited short (poster) presentations. They also appear in the proceedings. Combinatorial Pattern Matching (CPM) addresses issues of searching and matching strings and more complicated patterns such as trees, regular expr- sions, graphs, pointsets, andarrays, invariousformats.Thegoalistoderiven- trivialcombinatorialproperties ofsuchstructures andtoexploitthese properties in order to achieve superior performance for the corresponding computational problems. On the other hand, an important aim is to analyze and pinpoint the properties and conditions under which searches can not be performed e ciently. Overthepastdecadeasteady ?owofhighqualityresearch onthissubject 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 involverequirements forinformationretrieval inheterogeneous databases, data compression, and pattern recognition. The objective of the annual CPM gathering is to provide an international forum for the presentation of research results in combinatorial pattern matching and related applications.
Read Less
Add this copy of Combinatorial Pattern Matching: 12th Annual Symposium, to cart. $60.65, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2001 by Springer.
Add this copy of Combinatorial Pattern Matching: 12th Annual Symposium, to cart. $61.22, new condition, Sold by Ria Christie Books rated 4.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 2001 by Springer.
Add this copy of Combinatorial Pattern Matching: 12th Annual Symposium, to cart. $62.76, new condition, Sold by GreatBookPricesUK5 rated 4.0 out of 5 stars, ships from Castle Donington, DERBYSHIRE, UNITED KINGDOM, published 2001 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Trade paperback (US). Glued binding. 280 p. Lecture Notes in Computer Science, 2089. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Combinatorial Pattern Matching to cart. $93.92, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 2001 by Springer.
