|
131 |
Analysis of Algorithms for Graph Pattern Matching Problems Shaw, Dilip Kumar. - Saarbrücken : LAP LAMBERT Academic Publishing, 2018, 1. Auflage
|
|
|
132 |
Approximate Minimum-Weight Matching with Outliers Under Translation Agarwal, Pankaj K.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
133 |
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments Korenwein, Viatcheslav. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
134 |
Deterministic Algorithms for Maximum Matching on General Graphs in the Semi-Streaming Model Tirodkar, Sumedh. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
135 |
Development of block matching algorithms for motion estimation. Part 1 Van Truong, Nguyen. - Saarbrücken : LAP LAMBERT Academic Publishing, 2018, 1. Auflage
|
|
|
136 |
Development of block matching algorithms for motion estimation. Part 2 Van Truong, Nguyen. - Saarbrücken : LAP LAMBERT Academic Publishing, 2018, 1. Auflage
|
|
|
137 |
Dictionary Matching in Elastic-Degenerate Texts with Applications in Searching VCF Files On-line Pissis, Solon P.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
138 |
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms Arar, Moab. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
139 |
Efficient Content-based Publish/Subscribe Routing and Boolean Expression Matching Algorithms Ji, Shuping. - München : Universitätsbibliothek der TU München, 2018
|
|
|
140 |
Fast matching statistics in small space Belazzougui, Djamal. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|