|
151 |
Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints
Kesselheim, Thomas. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
|
|
152 |
Symmetric Interdiction for Matching Problems
Haney, Samuel. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
|
|
153 |
The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs
Cormode, Graham. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
|
154 |
A study and analysis on block matching algorithms for motion estimation in video coding
Enthalten in Cluster computing 9.12.2017: 1-8
|
|
|
|
155 |
A novel time series behavior matching algorithm for online conversion algorithms
Enthalten in Cluster computing 8.12.2017: 1-8
|
|
|
|
156 |
New algorithms for fixed-length approximate string matching and approximate circular string matching under the Hamming distance
Enthalten in The journal of supercomputing 20.11.2017: 1-20
|
|
|
|
157 |
Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms
Enthalten in Algorithmica 6.6.2017: 1-22
|
|
|
|
158 |
Control of force during rapid visuomotor force-matching tasks can be described by discrete time PID control algorithms
Enthalten in Experimental brain research 29.5.2017: 1-13
|
|
|
|
159 |
A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching
Raghvendra, Sharath. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
|
160 |
Beating Ratio 0.5 for Weighted Oblivious Matching Problems
Abolhassani, Melika. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
Administration
