Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	Oktober 2007
Genre:	EDV / Informatik
	Algorithms & data structures / Artificial Intelligence / C / Coding and Information Theory / Coding theory / Coding theory & cryptology / computer science / Data Mining / Data Mining and Knowledge Discovery / Data Science / Data Structures / Data structures (Computer science) / Data Structures and Information Theory / Database Management / database programming / Databases / Datenbanken / Expert systems / knowledge-based systems / Information theory / Kodierungstheorie und Verschlüsselung (Kryptologie) / Künstliche Intelligenz / Wissensbasierte Systeme, Expertensysteme mehr...
ISBN:	9783540755296
EAN-Code:	9783540755296
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#4726 - Lecture Notes in Computer Science Theoretical Computer Science and General Issues
Dimensionen:	H 235 mm / B 155 mm / D
Gewicht:	504 gr
Seiten:	311
Illustration:	XII, 311 p.
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

A Chaining Algorithm for Mapping cDNA Sequences to Multiple Genomic Sequences.- Edge-Guided Natural Language Text Compression.- Local Transpositions in Alignment of Polyphonic Musical Sequences.- Efficient Computations of ?1 and ???? Rearrangement Distances.- Generalized LCS.- Exploiting Genre in Focused Crawling.- Admission Policies for Caches of Search Engine Results.- A Pocket Guide to Web History.- Jump-Matching with Errors.- Estimating Number of Citations Using Author Reputation.- A Fast and Compact Web Graph Representation.- A Filtering Algorithm for k-Mismatch with Don't Cares.- Compact Set Representation for Information Retrieval.- Approximate Swap and Mismatch Edit Distance.- Approximating Constrained LCS.- Tuning Approximate Boyer-Moore for Gene Sequences.- Optimal Self-adjusting Trees for Dynamic String Data in Secondary Storage.- Indexing a Dictionary for Subset Matching Queries.- Extending Weighting Models with a Term Quality Measure.- Highly Frequent Terms and Sentence Retrieval.- Implicit Compression Boosting with Applications to Self-indexing.- A Web-Page Usage Prediction Scheme Using Weighted Suffix Trees.- Enhancing Educational-Material Retrieval Using Authored-Lesson Metadata.- Approximate String Matching with Lempel-Ziv Compressed Indexes.- Algorithms for Weighted Matching.- Efficient Text Proximity Search.- Prefix-Shuffled Geometric Suffix Tree.