Zobrazeno 1 - 10
of 12 147
pro vyhledávání: '"Probst, P"'
Evaluating the output of generative large language models (LLMs) is challenging and difficult to scale. Most evaluations of LLMs focus on tasks such as single-choice question-answering or text classification. These tasks are not suitable for assessin
Externí odkaz:
http://arxiv.org/abs/2408.09831
Autor:
Brand, Jan van den, Chen, Li, Kyng, Rasmus, Liu, Yang P., Meierhans, Simon, Gutenberg, Maximilian Probst, Sachdeva, Sushant
We give the first almost-linear total time algorithm for deciding if a flow of cost at most $F$ still exists in a directed graph, with edge costs and capacities, undergoing decremental updates, i.e., edge deletions, capacity decreases, and cost incre
Externí odkaz:
http://arxiv.org/abs/2407.10830
In this paper, we investigate the question of whether the electrical flow routing is a good oblivious routing scheme on an $m$-edge graph $G = (V, E)$ that is a $\Phi$-expander, i.e. where $\lvert \partial S \rvert \geq \Phi \cdot \mathrm{vol}(S)$ fo
Externí odkaz:
http://arxiv.org/abs/2406.07252
Optimal multi-layer device design requires consideration of fabrication uncertainties associated with inter-layer alignment and conformal layering. We present layer-restricted topology optimization (TO), a novel technique which mitigates the effects
Externí odkaz:
http://arxiv.org/abs/2404.07104
Quantifying the semantic similarity between database queries is a critical challenge with broad applications, ranging from query log analysis to automated educational assessment of SQL skills. Traditional methods often rely solely on syntactic compar
Externí odkaz:
http://arxiv.org/abs/2403.14441
In this work, we present the first algorithm to compute expander decompositions in an $m$-edge directed graph with near-optimal time $\tilde{O}(m)$. Further, our algorithm can maintain such a decomposition in a dynamic graph and again obtains near-op
Externí odkaz:
http://arxiv.org/abs/2403.04542
Autor:
Ochmann, M. W., Kollatschny, W., Probst, M. A., Romero-Colmenero, E., Buckley, D. A. H., Chelouche, D., Chini, R., Grupe, D., Haas, M., Kaspi, S., Komossa, S., Parker, M. L., Santos-Lleo, M., Schartel, N., Famula, P.
Publikováno v:
A&A 686, A17 (2024)
NGC 1566 is known for exhibiting recurrent outbursts, which are accompanied by changes in spectral type. The most recent transient event occurred from 2017 to 2019 and was reported to be accompanied by a change in Seyfert classification from Seyfert
Externí odkaz:
http://arxiv.org/abs/2402.12054
We present a general toolbox, based on new vertex sparsifiers, for designing data structures to maintain shortest paths in dynamic graphs. In an $m$-edge graph undergoing edge insertions and deletions, our data structures give the first algorithms fo
Externí odkaz:
http://arxiv.org/abs/2311.06402
Autor:
Brand, Jan van den, Chen, Li, Kyng, Rasmus, Liu, Yang P., Peng, Richard, Gutenberg, Maximilian Probst, Sachdeva, Sushant, Sidford, Aaron
We provide an algorithm which, with high probability, maintains a $(1-\epsilon)$-approximate maximum flow on an undirected graph undergoing $m$-edge additions in amortized $m^{o(1)} \epsilon^{-3}$ time per update. To obtain this result, we provide a
Externí odkaz:
http://arxiv.org/abs/2311.03174
Autor:
Brand, Jan van den, Chen, Li, Kyng, Rasmus, Liu, Yang P., Peng, Richard, Gutenberg, Maximilian Probst, Sachdeva, Sushant, Sidford, Aaron
We give a deterministic $m^{1+o(1)}$ time algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral demands, costs, and capacities. As a consequence, we obtain the first run
Externí odkaz:
http://arxiv.org/abs/2309.16629