Buch, Englisch, Band 13, 772 Seiten, Format (B × H): 167 mm x 247 mm, Gewicht: 1461 g
Reihe: Combinatorial Optimization
Buch, Englisch, Band 13, 772 Seiten, Format (B × H): 167 mm x 247 mm, Gewicht: 1461 g
Reihe: Combinatorial Optimization
ISBN: 978-1-4020-0953-2
Verlag: Springer Us
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Zeichen- und Zahlendarstellungen
- Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
- Mathematik | Informatik Mathematik Operations Research Graphentheorie
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Mustererkennung, Biometrik
- Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik
- Naturwissenschaften Physik Angewandte Physik Statistische Physik, Dynamische Systeme
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Informationstheorie, Kodierungstheorie
Weitere Infos & Material
Correcting the Training Data.- Context Free Grammars and Semantic Networks for Flexible Assembly Recognition.- Stochastic Recognition of Occluded Objects.- Approximate String Matching for Angular String Elements with Applications to On-line and Off-line Handwriting Recognition.- Uniform, Fast Convergence of Arbitrarily Tight Upper and Lower Bounds on the Bayes Error.- Building RBF Networks for Time Series Classification by Boosting.- Similarity Measures and Clustering of String Patterns.- Pattern Recognition for Intrusion Detection in Computer Networks.- Model-Based Pattern Recognition.- Structural Pattern Recognition in Graphs.- Deriving Pseudo-Probabilities of Correctness Given Scores (DPPS).- Weighed Mean and Generalized Median of Strings.- A Region-Based Algorithm for Classifier-Independent Feature Selection.- Inference of K-Piecewise Testable Tree Languages.- Mining Partially Periodic Patterns With Unknown Periods From Event tream.- Combination of Classifiers for Supervised Learning: A Survey.- Image Segmentation and Pattern Recognition: A Novel Concept, the Histogram of Connected Elements.- Prototype Extraction for k-NN Classifiers using Median Strings.- Cyclic String Matching: Efficient Exact and Approximate Algorithms.- Homogeneity, Autocorrelation and Anisotropy in Patterns.- Robust Structural Indexing through Quasi-Invariant Shape Signatures and Feature Generation.- Energy Minimisation Methods for Static and Dynamic Curve Matching.- Recent Feature Selection Methods in Statistical Pattern Recognition.- Fast Image Segmentation under Noise.- Set Analysis of Coincident Errors and Its Applications for Combining Classifiers.- Enhanced Neighbourhood Specifications for Pattern Classification.- Algorithmic Synthesis in Neural Network Training for Pattern Recognition.-Binary Strings and multi-class learning problems.