Skip to main content

Research Repository

Advanced Search

All Outputs (1380)

Compiler support for semi-manual AoS-to-SoA conversions with data views (2024)
Presentation / Conference Contribution
Radtke, P., & Weinzierl, T. (2024, September). Compiler support for semi-manual AoS-to-SoA conversions with data views. Presented at PPAM 2024 - 15th International Conference on Parallel Processing & Applied Mathematics, Ostrava, Czech Republic

The C programming language and its cousins such as C++ stipulate the static storage of sets of structured data: Developers have to commit to one, invariant data model -- typically a structure-of-arrays (SoA) or an array-of-structs (AoS) -- unles... Read More about Compiler support for semi-manual AoS-to-SoA conversions with data views.

Uncertainty Flow Diagrams: Towards a Systematic Representation of Uncertainty Propagation and Interaction in Adaptive Systems (2024)
Presentation / Conference Contribution
Camara, J., Hahner, S., Perez-Palacin, D., Vallecillo, A., Acosta, M., Bencomo, N., Calinescu, R., & Gerasimou, S. (2024, April). Uncertainty Flow Diagrams: Towards a Systematic Representation of Uncertainty Propagation and Interaction in Adaptive Systems. Presented at 2024 IEEE/ACM 19th Symposium on Software Engineering for Adaptive and Self-Managing Systems, Lisbon, Portugal

Sources of uncertainty in adaptive systems are rarely independent, and their interaction can affect the attainment of system goals in unpredictable ways. Despite ample work on “taming” uncertainty, the research community has devoted little attention... Read More about Uncertainty Flow Diagrams: Towards a Systematic Representation of Uncertainty Propagation and Interaction in Adaptive Systems.

Depth-Aware Endoscopic Video Inpainting (2024)
Presentation / Conference Contribution
Xiatian Zhang, F., Chen, S., Xie, X., & Shum, H. P. (2024, October). Depth-Aware Endoscopic Video Inpainting. Presented at 27th International Conference on Medical Image Computing and Computer Assisted Intervention, Marrakesh, Morocco

Self-Regulated Sample Diversity in Large Language Models (2024)
Presentation / Conference Contribution
Liu, M., Frawley, J., Wyer, S., Shum, H. P. H., Uckelman, S. L., Black, S., & Willcocks, C. G. (2024, June). Self-Regulated Sample Diversity in Large Language Models. Presented at NAACL 2024: 2024 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Mexico City

PRAGO: Differentiable Multi-View Pose Optimization From Objectness Detections* (2024)
Presentation / Conference Contribution
Taiana, M., Toso, M., James, S., & Bue, A. D. (2024, March). PRAGO: Differentiable Multi-View Pose Optimization From Objectness Detections*. Presented at 2024 International Conference on 3D Vision (3DV), Davos, Switzerland

Robustly estimating camera poses from a set of images is a fundamental task which remains challenging for differentiable methods, especially in the case of small and sparse camera pose graphs. To overcome this challenge, we propose Pose-refined Rotat... Read More about PRAGO: Differentiable Multi-View Pose Optimization From Objectness Detections*.

Latency-aware RDMSim: Enabling the Investigation of Latency in Self-Adaptation for the Case of Remote Data Mirroring (2024)
Presentation / Conference Contribution
Götz, S., Samin, H., & Bencomo, N. (2024, April). Latency-aware RDMSim: Enabling the Investigation of Latency in Self-Adaptation for the Case of Remote Data Mirroring. Presented at SEAMS '24: 19th International Conference on Software Engineering for Adaptive and Self-Managing Systems, Lisbon, Portugal

Self-adaptive systems are able to adapt themselves according to changing contextual conditions to ensure a set of predefined objectives (e.g., certain non-functional requirements like reliability) is reached. For this, they perform adaptation actions... Read More about Latency-aware RDMSim: Enabling the Investigation of Latency in Self-Adaptation for the Case of Remote Data Mirroring.

Decentralized Multi-Agent Coverage Path Planning with Greedy Entropy Maximization (2024)
Presentation / Conference Contribution
Champagnie, K., Arvin, F., & Hu, J. (2024, March). Decentralized Multi-Agent Coverage Path Planning with Greedy Entropy Maximization. Presented at 2024 IEEE International Conference on Industrial Technology (ICIT), Bristol, UK

In this paper, we present GEM, a novel approach to online coverage path planning in which a swarm of homogeneous agents act to maximize the entropy of pheromone deposited within their environment. We show that entropy maximization (EM) coincides with... Read More about Decentralized Multi-Agent Coverage Path Planning with Greedy Entropy Maximization.

Doctoral Colloquium—How Interactivity and Presence Affect Learning in Immersive Virtual Reality: A Mixed Methods Study Design (2024)
Presentation / Conference Contribution
Fern, N., Cristea, A. I., Nolan, S., & Stewart, C. (2024, June). Doctoral Colloquium—How Interactivity and Presence Affect Learning in Immersive Virtual Reality: A Mixed Methods Study Design. Presented at 10th International Conference of the Immersive Learning Research Network, Glasgow, Scotland, UK

This doctoral colloquium paper describes a mixed-methods study to investigate the impact of high interactivity Immersive Virtual Reality (iVR) materials on learning in higher education. It is motivated by the changing landscape of iVR technology and... Read More about Doctoral Colloquium—How Interactivity and Presence Affect Learning in Immersive Virtual Reality: A Mixed Methods Study Design.

Reading CD Readers (2024)
Presentation / Conference Contribution
Bell, E. (2024, June). Reading CD Readers. Presented at Code as Conversation: Transmedia Dialogues Around Critical Code Studies, Cambridge Digital Humanities, Cambridge University

Paraphrase Generation and Identification at Paragraph-Level (2024)
Presentation / Conference Contribution
Al Saqaabi, A., Stewart, C., Akrida, E., & Cristea, A. I. (2024, June). Paraphrase Generation and Identification at Paragraph-Level. Presented at Generative Intelligence and Intelligent Tutoring Systems ITS 2024, Thessaloniki, Greece

Towards Neuro-Enhanced Education: A Systematic Review of BCI-Assisted Development for Non-academic Skills and Abilities (2024)
Presentation / Conference Contribution
Pan, Z., & Cristea, A. I. (2024, June). Towards Neuro-Enhanced Education: A Systematic Review of BCI-Assisted Development for Non-academic Skills and Abilities. Presented at ITS 2024: Generative Intelligence and Intelligent Tutoring Systems, Thessaloniki, Greece

Students’ success in the 21st century demands not only strong academic skills but also well-developed Non-academic Skills and Abilities (NaSAs) such as critical thinking, concentration, and emotion regulation. The emerging field of Brain-Computer Int... Read More about Towards Neuro-Enhanced Education: A Systematic Review of BCI-Assisted Development for Non-academic Skills and Abilities.

Temporal Graph Realization from Fastest Paths (2024)
Presentation / Conference Contribution
Klobas, N., Mertzios, G., Molter, H., & Spirakis, P. (2024, June). Temporal Graph Realization from Fastest Paths. Presented at 3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, Patras, Greece

In this paper we initiate the study of the temporal graph realization problem with respect to the fastest path durations among its vertices, while we focus on periodic temporal graphs. Given an n × n matrix D and a Δ ∈ ℕ, the goal is to construct a Δ... Read More about Temporal Graph Realization from Fastest Paths.

Edge Multiway Cut and Node Multiway Cut are hard for planar subcubic graphs (2024)
Presentation / Conference Contribution
Johnson, M., Martin, B., Pandey, S., Paulusma, D., Smith, S., & van Leeuwen, E. J. (2024, June). Edge Multiway Cut and Node Multiway Cut are hard for planar subcubic graphs. Presented at SWAT 2024, Helsinki, Finland

It is known that the weighted version of Edge Multiway Cut (also known as Multiterminal Cut) is NP-complete on planar graphs of maximum degree 3. In contrast, for the unweighted version, NP-completeness is only known for planar graphs of maximum degr... Read More about Edge Multiway Cut and Node Multiway Cut are hard for planar subcubic graphs.

Brief Announcement: On the Existence of δ-Temporal Cliques in Random Simple Temporal Graphs (2024)
Presentation / Conference Contribution
Mertzios, G., Nikoletseas, S., Raptopoulos, C., & Spirakis, P. (2024, June). Brief Announcement: On the Existence of δ-Temporal Cliques in Random Simple Temporal Graphs. Presented at 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024), Patras, Greece

We consider random simple temporal graphs in which every edge of the complete graph K_n appears once within the time interval [0,1] independently and uniformly at random. Our main result is a sharp threshold on the size of any maximum δ-clique (namel... Read More about Brief Announcement: On the Existence of δ-Temporal Cliques in Random Simple Temporal Graphs.

Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization (2024)
Presentation / Conference Contribution
Erlebach, T., Morawietz, N., & Wolf, P. (2024, June). Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization. Presented at 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024), Patras, Greece

In the periodic temporal graph realization problem introduced by Klobas et al. [SAND '24] one is given a period Δ and an n× n matrix D of desired fastest travel times, and the task is to decide if there is a simple periodic temporal graph with period... Read More about Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization.