Zobrazeno 1 - 10
of 4 587
pro vyhledávání: '"ERIK, JAN"'
Synthetic data generation is a promising technique to facilitate the use of sensitive data while mitigating the risk of privacy breaches. However, for synthetic data to be useful in downstream analysis tasks, it needs to be of sufficient quality. Var
Externí odkaz:
http://arxiv.org/abs/2408.13167
Autor:
Li, Yifei, van Kampen, Erik-jan
Symmetry is an essential property in some dynamical systems that can be exploited for state transition prediction and control policy optimization. This paper develops two symmetry-integrated Reinforcement Learning (RL) algorithms based on standard De
Externí odkaz:
http://arxiv.org/abs/2407.11077
Decision-making processes often involve voting. Human interactions with exogenous entities such as legislations or products can be effectively modeled as two-mode (bipartite) signed networks-where people can either vote positively, negatively, or abs
Externí odkaz:
http://arxiv.org/abs/2405.08203
Autor:
van Kesteren, Erik-Jan
For over 30 years, synthetic data has been heralded as a promising solution to make sensitive datasets accessible. However, despite much research effort and several high-profile use-cases, the widespread adoption of synthetic data as a tool for open,
Externí odkaz:
http://arxiv.org/abs/2404.17271
The intensively studied Diameter problem is to find the diameter of a given connected graph. We investigate, for the first time in a structured manner, the complexity of Diameter for H-free graphs, that is, graphs that do not contain a fixed graph H
Externí odkaz:
http://arxiv.org/abs/2402.16678
Autor:
Zürcher, Erik Jan, author
Publikováno v:
Unconquered States : Non-European Powers in the Imperial Age, 2024.
Externí odkaz:
https://doi.org/10.1093/oso/9780198863298.003.0002
Autor:
Keusters, Guus, Batelaan, Frédérique, SleeswijkVisser, Froukje, Houwing, Erik-Jan, Bakker, Hans
Publikováno v:
Journal of Engineering, Design and Technology, 2023, Vol. 23, Issue 1, pp. 184-206.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/JEDT-08-2022-0431
Autor:
Kisfaludi-Bak, Sándor, Masaříková, Jana, van Leeuwen, Erik Jan, Walczak, Bartosz, Węgrzycki, Karol
The hyperbolicity of a graph, informally, measures how close a graph is (metrically) to a tree. Hence, it is intuitively similar to treewidth, but the measures are formally incomparable. Motivated by the broad study of algorithms and separators on pl
Externí odkaz:
http://arxiv.org/abs/2310.11283
Autor:
Bodlaender, Hans L., Mannens, Isja, Oostveen, Jelle J., Pandey, Sukanya, van Leeuwen, Erik Jan
The Integer Multicommodity Flow problem has been studied extensively in the literature. However, from a parameterised perspective, mostly special cases, such as the Disjoint Paths problem, have been considered. Therefore, we investigate the parameter
Externí odkaz:
http://arxiv.org/abs/2310.05784
We consider a natural generalization of Vertex Cover: the Subset Vertex Cover problem, which is to decide for a graph $G=(V,E)$, a subset $T \subseteq V$ and integer $k$, if $V$ has a subset $S$ of size at most $k$, such that $S$ contains at least on
Externí odkaz:
http://arxiv.org/abs/2307.05701