Zobrazeno 1 - 10
of 1 421
pro vyhledávání: '"Kleist, P."'
We consider facet-Hamiltonian cycles of polytopes, defined as cycles in their skeleton such that every facet is visited exactly once. These cycles can be understood as optimal watchman routes that guard the facets of a polytope. We consider the exist
Externí odkaz:
http://arxiv.org/abs/2411.02172
For a set $P$ of $n$ points in general position in the plane, the flip graph $F(P)$ has a vertex for each non-crossing spanning tree on $P$ and an edge between any two spanning trees that can be transformed into each other by one edge flip. The diame
Externí odkaz:
http://arxiv.org/abs/2410.23809
Autor:
Bennetzen, Benjamin, Kleist, Daniel Vang, Steinmann, Emilie Sonne, Walsted, Loke, Kristensen, Nikolaj Rossander, Steffensen, Peter Buus
This paper presents the syntax and reduction rules for an abstract machine based on the JavaScript XML language. We incorporate the notion of cost into our reduction rules, and create a type system that over-approximate this cost. This over-approxima
Externí odkaz:
http://arxiv.org/abs/2410.18158
Autor:
Bennetzen, Benjamin, Kleist, Daniel Vang, Steinmann, Emilie Sonne, Walsted, Loke, Kristensen, Nikolaj Rossander, Steffensen, Peter Buus
Protecting confidential data from leaking is a critical challenge in computer systems, particularly given the growing number of observers on the internet. Therefore, limiting information flow using robust security policies becomes increasingly vital.
Externí odkaz:
http://arxiv.org/abs/2410.18157
Autor:
Akitaya, Hugo A., Biniaz, Ahmad, Demaine, Erik D., Kleist, Linda, Stock, Frederick, Tóth, Csaba D.
For a set of red and blue points in the plane, a minimum bichromatic spanning tree (MinBST) is a shortest spanning tree of the points such that every edge has a red and a blue endpoint. A MinBST can be computed in $O(n\log n)$ time where $n$ is the n
Externí odkaz:
http://arxiv.org/abs/2409.11614
Autor:
Becker, Aaron T., Fekete, Sándor P., Huang, Li, Keldenich, Phillip, Kleist, Linda, Krupke, Dominik, Rieck, Christian, Schmidt, Arne
We investigate algorithmic approaches for targeted drug delivery in a complex, maze-like environment, such as a vascular system. The basic scenario is given by a large swarm of micro-scale particles (''agents'') and a particular target region (''tumo
Externí odkaz:
http://arxiv.org/abs/2408.09729
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a flip graph
Externí odkaz:
http://arxiv.org/abs/2407.03912
Active feature acquisition (AFA) agents, crucial in domains like healthcare where acquiring features is often costly or harmful, determine the optimal set of features for a subsequent classification task. As deploying an AFA agent introduces a shift
Externí odkaz:
http://arxiv.org/abs/2312.03619
Machine learning methods often assume that input features are available at no cost. However, in domains like healthcare, where acquiring features could be expensive or harmful, it is necessary to balance a feature's acquisition cost against its predi
Externí odkaz:
http://arxiv.org/abs/2312.01530
Publikováno v:
Patient Preference and Adherence, Vol Volume 18, Pp 1493-1507 (2024)
Lukas Kühn,1,2 Lara Kleist,1 Franziska Weißenstein,1 Kyung-Eun Anna Choi1,3 1Center for Health Services Research, Brandenburg Medical School, Rüdersdorf bei Berlin, 15562, Germany; 2Faculty of Health Sciences Brandenburg, Brandenburg Medical Schoo
Externí odkaz:
https://doaj.org/article/4b4fa30581594aa0a8aeaaf679d52538
