Suche
Ergebnisse
-
The k-Server Problem with Delays on the Uniform Metric Space
(2020)Leibniz International Proceedings in Informatics (LIPIcs) ~ 31st International Symposium on Algorithms and Computation (ISAAC 2020)In this paper, we present tight bounds for the k-server problem with delays in the uniform metric space. The problem is defined on n+k nodes in the uniform metric space which can issue requests over time. These requests can be served directly or with some delay using k servers, by moving a server to the corresponding node with an open request. The task is to find an online algorithm that can serve the requests while minimizing the total ...Conference Paper -
MIDI-VAE: Modeling Dynamics and Instrumentation of Music with Applications to Style Transfer
(2018)Proceedings of the 19th International Society for Music Information Retrieval Conference (ISMIR 2018)We introduce MIDI-VAE, a neural network model basedon Variational Autoencoders that is capable of handlingpolyphonic music with multiple instrument tracks, as wellas modeling the dynamics of music by incorporating notedurations and velocities. We show that MIDI-VAE can per-form style transfer on symbolic music by automaticallychanging pitches, dynamics and instruments of a musicpiece from, e.g., a Classical to a ...Conference Paper -
Algorithmic Channel Design
(2018)Leibniz International Proceedings in Informatics (LIPIcs) ~ 29th International Symposium on Algorithms and Computation (ISAAC 2018)Payment networks, also known as channels, are a most promising solution to the throughput problem of cryptocurrencies. In this paper we study the design of capital-efficient payment networks, offline as well as online variants. We want to know how to compute an efficient payment network topology, how capital should be assigned to the individual edges, and how to decide which transactions to accept. Towards this end, we present a flurry ...Conference Paper -
Impatient Online Matching
(2018)Leibniz International Proceedings in Informatics (LIPIcs) ~ 29th International Symposium on Algorithms and Computation (ISAAC 2018)We investigate the problem of Min-cost Perfect Matching with Delays (MPMD) in which requests are pairwise matched in an online fashion with the objective to minimize the sum of space cost and time cost. Though linear-MPMD (i.e., time cost is linear in delay) has been thoroughly studied in the literature, it does not well model impatient requests that are common in practice. Thus, we propose convex-MPMD where time cost functions are convex, ...Conference Paper -
Min-Cost Bipartite Perfect Matching with Delays
(2017)Leibniz International Proceedings in Informatics (LIPIcs) ~ Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)In the min-cost bipartite perfect matching with delays (MBPMD) problem, requests arrive online at points of a finite metric space. Each request is either positive or negative and has to be matched to a request of opposite polarity. As opposed to traditional online matching problems, the algorithm does not have to serve requests as they arrive, and may choose to match them later at a cost. Our objective is to minimize the sum of the distances ...Conference Paper