Zobrazeno 1 - 10
of 7 443
pro vyhledávání: '"Thorup, A"'
We consider the problem of coloring a 3-colorable graph in polynomial time using as few colors as possible. This is one of the most challenging problems in graph algorithms. In this paper using Blum's notion of ``progress'', we develop a new combinat
Externí odkaz:
http://arxiv.org/abs/2406.00357
Autor:
Cohen-Addad, Vincent, Lolck, David Rasmussen, Pilipczuk, Marcin, Thorup, Mikkel, Yan, Shuyi, Zhang, Hanwen
Correlation Clustering is a classic clustering objective arising in numerous machine learning and data mining applications. Given a graph $G=(V,E)$, the goal is to partition the vertex set into clusters so as to minimize the number of edges between c
Externí odkaz:
http://arxiv.org/abs/2404.05433
An electric car equipped with a battery of a finite capacity travels on a road network with an infrastructure of charging stations. Each charging station has a possibly different cost per unit of energy. Traversing a given road segment requires a spe
Externí odkaz:
http://arxiv.org/abs/2403.16936
Hashing is a common technique used in data processing, with a strong impact on the time and resources spent on computation. Hashing also affects the applicability of theoretical results that often assume access to (unrealistic) uniform/fully-random h
Externí odkaz:
http://arxiv.org/abs/2308.14134
Autor:
Christensen, Rasmus S., Thorup, Peter S., Jørgensen, Lasse R., Roelsgaard, Martin, Fischer, Karl F. F., Dippel, Ann-Christin, Iversen, Bo Brummerstedt
Cu$_2$Se is a mixed ionic-electronic conductor with outstanding thermoelectric performance originally envisioned for space missions. Applications were discontinued due to material instability, where elemental Cu grows at the electrode interfaces duri
Externí odkaz:
http://arxiv.org/abs/2308.03559
Autor:
Michael Brun Andersen, Aska Drljevic-Nielsen, Jeanette Haar Ehlers, Kennet Sønderstgaard Thorup, Anders Ohlhues Baandrup, Majbritt Palne, Finn Rasmussen
Publikováno v:
Cancer Imaging, Vol 24, Iss 1, Pp 1-12 (2024)
Abstract Background With the development of immune checkpoint inhibitors for the treatment of non-small cell lung cancer, the need for new functional imaging techniques and early response assessments has increased to account for new response patterns
Externí odkaz:
https://doaj.org/article/4bbfb080d2104bbb81d85bdc42010df6
Autor:
Houen, Jakob Bæk Tejs, Thorup, Mikkel
The \emph{Sparse Johnson-Lindenstrauss Transform} of Kane and Nelson (SODA 2012) provides a linear dimensionality-reducing map $A \in \mathbb{R}^{m \times u}$ in $\ell_2$ that preserves distances up to distortion of $1 + \varepsilon$ with probability
Externí odkaz:
http://arxiv.org/abs/2305.03110
We revisit Nisan's classical pseudorandom generator (PRG) for space-bounded computation (STOC 1990) and its applications in streaming algorithms. We describe a new generator, HashPRG, that can be thought of as a symmetric version of Nisan's generator
Externí odkaz:
http://arxiv.org/abs/2304.06853
Autor:
Goranci, Gramoz, Henzinger, Monika, Nanongkai, Danupon, Saranurak, Thatchaphol, Thorup, Mikkel, Wulff-Nilsen, Christian
Given a simple $n$-vertex, $m$-edge graph $G$ undergoing edge insertions and deletions, we give two new fully dynamic algorithms for exactly maintaining the edge connectivity of $G$ in $\tilde{O}(n)$ worst-case update time and $\tilde{O}(m^{1-1/31})$
Externí odkaz:
http://arxiv.org/abs/2302.05951