Publication

Practical Sketching Algorithms For Low-Rank Matrix Approximation

Publications associées (31)

Nonperturbative aspects of scattering amplitudes

In this thesis we study how physical principles imposed on the S-matrix, such as Lorentz invariance, unitarity, crossing symmetry and analyticity constrain quantum field theories at the nonperturbative level. We start with a pedagogical introduction to the ...

EPFL2023

T-5 configurations and hyperbolic systems

Carl Johan Peter Johansson, Riccardo Tione

In this paper, we study the rank-one convex hull of a differential inclusion associated to entropy solutions of a hyperbolic system of conservation laws. This was introduced in [B. Kirchheim, S. Muller and V. S(sic)ver & aacute;k, Studying Nonlinear PDE by ...

WORLD SCIENTIFIC PUBL CO PTE LTD2023

Learned Compressive Representations for Single-Photon 3D Imaging

Claudio Bruschini, Edoardo Charbon, Andrei Ardelean, Mohit Gupta

Single-photon 3D cameras can record the time-of-arrival of billions of photons per second with picosecond accuracy. One common approach to summarize the photon data stream is to build a per-pixel timestamp histogram, resulting in a 3D histogram tensor that ...

Ieee Computer Soc2023

Approximation Algorithms for Allocation and Network Design

Etienne Michel François Bamas

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

EPFL2023

Hilbert series, the Higgs mechanism, and HEFT

Brian Quinn Henning

We expand Hilbert series technologies in effective field theory for the inclusion of massive particles, enabling, among other things, the enumeration of operator bases for non-linearly realized gauge theories. We find that the Higgs mechanism is manifest a ...

Springer Nature2023

Results on Sparse Integer Programming and Geometric Independent Sets

Jana Tabea Cslovjecsek

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

EPFL2023

Ultra-High Sensitivity Silicon Nanowire Array Biosensor Based on a Constant-Current Method for Continuous Real-Time pH and Protein Monitoring in Interstitial Fluid

Mihai Adrian Ionescu, Yann Christophe Sprunger, Ali Saeidi, Luca Capua

In this paper we demonstrate ultra-high sensitivity silicon nanowires pH and protein sensing on the same Silicon nanowire array platform by using a constant current method and monitoring the drain voltage as function of analyte concentration. The injected ...

IEEE2023

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles

Paolo Ienne, Kubilay Atasu, Jovan Blanusa

Finding cycles in directed graphs enables important applications in various domains such as finance, biology, chemistry, and network science. However, as the size of graph datasets continues to grow, it becomes increasingly difficult to discover cycles wit ...

arXiv2023

Bayesian reconstruction of memories stored in neural networks from their connectivity

Florent Gérard Krzakala, Lenka Zdeborová

The advent of comprehensive synaptic wiring diagrams of large neural circuits has created the field of connectomics and given rise to a number of open research questions. One such question is whether it is possible to reconstruct the information stored in ...

2023

Quantum Field Theory in AdS Space instead of Lehmann-Symanzik-Zimmerman Axioms

Xiang Zhao

The boundary correlation functions for a quantum field theory (QFT) in a fixed anti-de Sitter (AdS) background should reduce to S-matrix elements in the flat-space limit. We consider this procedure in detail for four-point functions. With minimal assumptio ...

AMER PHYSICAL SOC2023

Singular quadratic eigenvalue problems: linearization and weak condition numbers

Daniel Kressner, Ivana Sain Glibic

The numerical solution of singular eigenvalue problems is complicated by the fact that small perturbations of the coefficients may have an arbitrarily bad effect on eigenvalue accuracy. However, it has been known for a long time that such perturbations are ...

SPRINGER2023