|
Showing 1 - 4 of
4 matches in All Departments
The papers contained in this volume were presented at the 19th
Annual S- posium on Combinatorial Pattern Matching (CPM 2008) held
at the University of Pisa, Italy, June 18-20, 2008. All the papers
presented at the conference are originalresearchcontributions on
computational pattern matching and analysis. They were selected
from 78 submissions. Each submission was reviewed by at least three
reviewers. The committee decided to accept 25 papers. The programme
also includes three invited talks by Daniel M. Gus?eld from the
University of California, Davis, USA, J. Ian Munro from the
University of Waterloo, Canada, and Prabhakar Raghavan from Yahoo!
Research, USA. The objective of the annual CPM meetings is to
provide an international forum for research in combinatorial
pattern matching and related applications. It addresses issues of
searching and matching strings and more complicated p- terns such
as trees, regular expressions, graphs, point sets, and arrays. The
goal is to derive non-trivialcombinatorialproperties of
suchstructures and to exploit these properties in order to either
achieve superior performance for the cor- sponding computational
problems or pinpoint conditions under which searches
cannotbeperformede?ciently. Themeeting also dealswith problems
incom- tational biology, data compression, data mining, coding,
information retrieval, natural language processing and pattern
recognition.
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.
|
You may like...
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
Higher
Michael Buble
CD
(1)
R487
Discovery Miles 4 870
|