Conference Contributions
Lower-level publication types
-
Conference Paper [35177]
-
Conference Poster [2345]
-
Conference Proceedings [499]
-
Other Conference Item [19046]
Recent Submissions
-
Hybrid Spherical Array for clinical optoacoustic ultrasound (OPUS) imaging
(2024)PHOTONS PLUS ULTRASOUND: IMAGING AND SENSING 2024Optoacoustic tomography (OAT) has made major advances towards clinical diagnostics in recent years. One major obstacle inhibiting the establishment of this non-invasive non-ionizing technique as a routine diagnostic device is the unfamiliarity of clinicians to OAT images. Several works have already been dedicated to combining Optoacoustic and Ultrasound imaging (OPUS). However, thus far, dual mode 1D arrays have mostly been employed. Not ...Conference Paper -
In vitro testing of an artificial muscle for the treatment of incontinence
(2024)ELECTROACTIVE POLYMER ACTUATORS AND DEVICES, EAPAD XXVIThe burden of incontinence is profound, affecting individuals both physically and emotionally. Treatment pathways typically progress from conservative measures to surgical interventions, sometimes culminating in the implantation of artificial sphincters. The existing models including the AMS 800(TM) show high revision rates. Complications such as tissue erosion further underscore the need for innovation in this field. Here, we propose an ...Conference Paper -
Fungal Circuitry: Mycelium as a Living Sensor for Smart Structures
(2024)SENSORS AND SMART STRUCTURES TECHNOLOGIES FOR CIVIL, MECHANICAL, AND AEROSPACE SYSTEMS 2024This work explores the sensing potential of mycelium with the intention of incorporating this as an intrinsic sensing mechanism within structural materials. Infrastructure plays a critical role in modern societies with regard to economic productivity, social cohesion, and community well-being. By merging materials that are used for construction, such as concrete with living components, we aim to add intrinsic monitoring mechanisms that ...Conference Paper -
Full-view low-cost LED-based optoacoustic tomography
(2024)PHOTONS PLUS ULTRASOUND: IMAGING AND SENSING 2024Optoacoustic tomography is typically implemented with bulky solid-state lasers delivering per-pulse energies in the millijoule range. Light emitting diodes (LEDs) represent a cost-effective and portable alternative for signal excitation further offering excellent pulse-to-pulse stability. Herein, we describe a full-view LED-based optoacoustic tomography (FLOAT) system for deep-tissue in vivo imaging. A custom-made electronic unit driving ...Conference Paper -
Towards a FRF-based parametric surrogate for guided wave-based evaluation in multiple defect scenarios
(2024)Health Monitoring of Structural and Biological Systems XVIIIConference Paper -
Private Graphon Estimation via Sum-of-Squares
(2024)STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of ComputingWe develop the first pure node-differentially-private algorithms for learning stochastic block models and for graphon estimation with polynomial running time for any constant number of blocks. The statistical utility guarantees match those of the previous best information-theoretic (exponential-time) node-private mechanisms for these problems. The algorithm is based on an exponential mech- anism for a score function defined in terms of a ...Conference Paper -
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow
(2024)STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of ComputingWe give the first almost-linear time algorithms for several problems in incremental graphs including cycle detection, strongly connected component maintenance, s-t shortest path, maximum flow, and minimum-cost flow. To solve these problems, we give a deterministic data structure that returns a mo(1)-approximate minimum-ratio cycle in fully dynamic graphs in amortized mo(1) time per update. Combining this with the interior point method ...Conference Paper -
Low-Step Multi-commodity Flow Emulators
(2024)STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of ComputingWe introduce the concept of low-step multi-commodity flow emulators for any undirected, capacitated graph. At a high level, these emulators contain approximate multi-commodity flows whose paths contain a small number of edges, shattering the infamous flow decomposition barrier for multi-commodity flow. We prove the existence of low-step multi-commodity flow emulators and develop efficient algorithms to compute them. We then apply them to ...Conference Paper -
A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications
(2024)STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of ComputingWe present a general toolbox, based on new vertex sparsifiers, for designing data structures to maintain shortest paths in graphs undergoing edge insertions and/or deletions. In particular, we obtain the following results: the first data structure to maintain mo(1)-approximate all-pairs shortest paths (APSP) in an m-edge graph undergoing edge insertions and deletions with worst-case update time mo(1) and query time Õ(1), and a data structure ...Conference Paper -
-
Navigating Autonomy: Unveiling Security Experts' Perspectives on Augmented Intelligence in Cybersecurity
(2024)The rapidly evolving cybersecurity threat landscape and shortage of skilled professionals are amplifying the need for technical support. AI tools offer great opportunities to support security experts by augmenting their intelligence and allowing them to focus on their unique human skills and expertise. For the successful design of AI tools and expert-AI interfaces, however, it is essential to understand the specialised security-critical ...Conference Paper -
Polylog-Competitive Deterministic Local Routing and Scheduling
(2024)STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of ComputingThis paper addresses point-to-point packet routing in undirected networks, which is the most important communication primitive in most networks. The main result proves the existence of routing tables that deterministically guarantee a polylog-competitive completion-time: In any undirected network, it is possible to give each node simple stateless deterministic local forwarding rules, such that, any adversarially chosen set of packets are ...Conference Paper -
Benchmarking the Fairness of Image Upsampling Methods
(2024)FAccT '24: Proceedings of the 2024 ACM Conference on Fairness, Accountability, and TransparencyRecent years have witnessed a rapid development of deep generative models for creating synthetic media, such as images and videos. While the practical applications of these models in everyday tasks are enticing, it is crucial to assess the inherent risks regarding their fairness. In this work, we introduce a comprehensive framework for benchmarking the performance and fairness of conditional generative models. We develop a set of metrics ...Conference Paper -
Reconfiguration of Basis Pairs in Regular Matroids
(2024)STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of ComputingIn recent years, combinatorial reconfiguration problems have attracted great attention due to their connection to various topics such as optimization, counting, enumeration, or sampling. One of the most intriguing open questions concerns the exchange distance of two matroid basis sequences, a problem that appears in several areas of computer science and mathematics. In 1980, White proposed a conjecture for the characterization of two basis ...Conference Paper -
Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping
(2024)STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of ComputingIn this paper, we present an efficient parallel derandomization method for randomized algorithms that rely on concentrations such as the Chernoff bound. This settles a classic problem in parallel derandomization, which dates back to the 1980s. Concretely, consider the set balancing problem where m sets of size at most s are given in a ground set of size n, and we should partition the ground set into two parts such that each set is split ...Conference Paper -
On the Communication Complexity of Approximate Pattern Matching
(2024)STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of ComputingConference Paper -
Equalised Odds is not Equal Individual Odds: Post-processing for Group and Individual Fairness
(2024)FAccT '24: Proceedings of the 2024 ACM Conference on Fairness, Accountability, and TransparencyGroup fairness is achieved by equalising prediction distributions between protected sub-populations; individual fairness requires treating similar individuals alike. These two objectives, however, are incompatible when a scoring model is calibrated through discontinuous probability functions, where individuals can be randomly assigned an outcome determined by a fixed probability. This procedure may provide two similar individuals from the ...Conference Paper -
Ghost Value Augmentation for k-Edge-Connectivity
(2024)STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of ComputingWe give a poly-time algorithm for the k-edge-connected spanning subgraph (k-ECSS) problem that returns a solution of cost no greater than the cheapest (k+10)-ECSS on the same graph. Our approach enhances the iterative relaxation framework with a new ingredient, which we call ghost values, that allows for high sparsity in intermediate problems. Our guarantees improve upon the best-known approximation factor of 2 for k-ECSS whenever the ...Conference Paper -
Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time
(2024)STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of ComputingA recent work by Christiansen, Nowicki, and Rotenberg [STOC'23] provides dynamic algorithms for coloring sparse graphs, concretely as a function of the graph's arboricity α. They give two randomized algorithms: O(α logα) implicit coloring in poly(logn) worst-case update and query times, and O(min{α logα, α logloglogn}) implicit coloring in poly(logn) amortized update and query times (against an oblivious adversary). We improve these results ...Conference Paper -
Auf dem Weg zum zentralen Informationsbudget – die APC-Richtlinien der ETH Zürich
(2024)Other Conference Item