Zum Hauptinhalt springen Zur Suche springen Zur Hauptnavigation springen
Dekorationsartikel gehören nicht zum Leistungsumfang.
Parallel and Bit-parallel Text Algorithms
Second Edition
Taschenbuch von Jan ¿Upol
Sprache: Englisch

54,75 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 4-7 Werktage

Produkt Anzahl: Gib den gewünschten Wert ein oder benutze die Schaltflächen um die Anzahl zu erhöhen oder zu reduzieren.
Kategorien:
Beschreibung
We present various parallel and bit-parallel text algorithms. A parallel solution of the arithmetic coding compression algorithm, the computation of the border array, and a new approach to pattern matching problems. This approach uses non-deterministic finite automata for pattern matching and their bit-parallel simulation. We also present a new solution to weighted degenerated pattern matching problem, which sets new conditions on the searched pattern, and a pattern matching which matches any subpattern of a length specified. This algorithm uses the bit-vector extension as well. Moreover, we present a new bit-parallel simulation of the determinisation of pattern matching automata and suffix automata. Our determinisation provides an increase in speed in comparison to a standard subset construction determinisation algorithm.
We present various parallel and bit-parallel text algorithms. A parallel solution of the arithmetic coding compression algorithm, the computation of the border array, and a new approach to pattern matching problems. This approach uses non-deterministic finite automata for pattern matching and their bit-parallel simulation. We also present a new solution to weighted degenerated pattern matching problem, which sets new conditions on the searched pattern, and a pattern matching which matches any subpattern of a length specified. This algorithm uses the bit-vector extension as well. Moreover, we present a new bit-parallel simulation of the determinisation of pattern matching automata and suffix automata. Our determinisation provides an increase in speed in comparison to a standard subset construction determinisation algorithm.
Über den Autor
Jan ¿upol received his Ph.D. degree at Czech Technical University in Prague (Czech Republic), in 2009. Currently, he works as software engineer with Oracle. He is married and has three children.
Details
Erscheinungsjahr: 2012
Genre: Informatik, Mathematik, Medizin, Naturwissenschaften, Technik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Inhalt: 164 S.
ISBN-13: 9783659286988
ISBN-10: 3659286982
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: ¿Upol, Jan
Hersteller: LAP LAMBERT Academic Publishing
Verantwortliche Person für die EU: LAP Lambert Academic Publishing, Brivibas Gatve 197, ?-1039 Riga, customerservice@vdm-vsg.de
Maße: 220 x 150 x 10 mm
Von/Mit: Jan ¿Upol
Erscheinungsdatum: 09.11.2012
Gewicht: 0,262 kg
Artikel-ID: 106175440
Über den Autor
Jan ¿upol received his Ph.D. degree at Czech Technical University in Prague (Czech Republic), in 2009. Currently, he works as software engineer with Oracle. He is married and has three children.
Details
Erscheinungsjahr: 2012
Genre: Informatik, Mathematik, Medizin, Naturwissenschaften, Technik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Inhalt: 164 S.
ISBN-13: 9783659286988
ISBN-10: 3659286982
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: ¿Upol, Jan
Hersteller: LAP LAMBERT Academic Publishing
Verantwortliche Person für die EU: LAP Lambert Academic Publishing, Brivibas Gatve 197, ?-1039 Riga, customerservice@vdm-vsg.de
Maße: 220 x 150 x 10 mm
Von/Mit: Jan ¿Upol
Erscheinungsdatum: 09.11.2012
Gewicht: 0,262 kg
Artikel-ID: 106175440
Sicherheitshinweis