6 papers
A Study in Dataset Distillation for Image Super-Resolution
Tobias Dietz, Brian B. Moser, Tobias Nauen +3
Dataset distillation aims to compress large datasets into compact yet highly informative subsets that preserve the training behavior of the original data. While this concept has ga…
Sparsifying Parity-Check Matrices
Luís M. S. Russo, Tobias Dietz, José Rui Figueira +2
Parity check matrices (PCMs) are used to define linear error correcting codes and ensure reliable information transmission over noisy channels. The set of codewords of such a code…
The {0,1}-knapsack problem with qualitative levels
Luca E. Schäfer, Tobias Dietz, Maria Barbati +3
A variant of the classical knapsack problem is considered in which each item is associated with an integer weight and a qualitative level. We define a dominance relation over the f…
A Reduced-Complexity Projection Algorithm for ADMM-based LP Decoding
Florian Gensheimer, Tobias Dietz, Kira Kraft +2
The Alternating Direction Method of Multipliers has recently been adapted for Linear Programming Decoding of Low-Density Parity-Check codes. The computation of the projection onto…
Introducing Multiobjective Complex Systems
Tobias Dietz, Kathrin Klamroth, Konstantin Kraus +5
This article focuses on the optimization of a complex system which is composed of several subsystems. On the one hand, these subsystems are subject to multiple objectives, local co…
Shortest Paths with Ordinal Weights
Luca E. Schäfer, Tobias Dietz, Nicolas Fröhlich +2
We investigate the single-source-single-destination "shortest" paths problem in acyclic graphs with ordinal weighted arc costs. We define the concepts of ordinal dominance and effi…