Category
Computational complexity theory
Related publications (1,000)
The Power of Two Matrices in Spectral Algorithms for Community Recovery
Spectral algorithms are some of the main tools in optimization and inference problems on graphs. Typically, the graph is encoded as a matrix and eigenvectors and eigenvalues of the matrix are then used to solve the given graph problem. Spectral algorithms ...
Ieee-Inst Electrical Electronics Engineers Inc2024On Speed and Advantage : Results in Information Velocity and Monitoring Problems
Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...
EPFL2024On-Chip Fully Reconfigurable Artificial Neural Network in 16 nm FinFET for Positron Emission Tomography
Edoardo Charbon, Claudio Bruschini, Emanuele Ripiccini, Andrada Alexandra Muntean
Smarty is a fully-reconfigurable on-chip feed-forward artificial neural network (ANN) with ten integrated time-to-digital converters (TDCs) designed in a 16 nm FinFET CMOS technology node. The integration of TDCs together with an ANN aims to reduce system ...
Piscataway2024Exact Obstacle Avoidance for Robots in Complex and Dynamic Environments Using Local Modulation
Robots outside of the fenced factories have to deal with continuously changing environment, this requires fast and flexible modes of control. Planning methods or complex learning models can find optimal paths in complex surroundings, but they are computati ...
EPFL2024Accurate and agile flight with winged drones
Drones hold promise to assist in civilian tasks. To realize this application, future drones must operate within large cities, covering large distances while navigating within cluttered urban landscapes. The increased efficiency of winged drones over rotary ...
EPFL2024High-Resolution Modeling Without Computation Slowdown for PETALE in CROCUS
Andreas Pautz, Vincent Pierre Lamirand, Thomas Jean-François Ligonnet, Axel Guy Marie Laureau
In a collaboration between Ecole Polytechnique Fédérale de Lausanne (EPFL) and CEA, in the fall of 2020, the experimental Programme d’Étude en Transmission de l’Acier Lourd et ses Eléments (PETALE) was successfully carried out in the CROCUS reactor of EPFL ...
2024Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points
We introduce an algorithm to reconstruct a mesh from discrete samples of a shape's Signed Distance Function (SDF). A simple geometric reinterpretation of the SDF lets us formulate the problem through a point cloud, from which a surface can be extracted wit ...
2024Modular segmentation, spatial analysis and visualization of volume electron microscopy datasets
Volume electron microscopy is the method of choice for the in situ interrogation of cellular ultrastructure at the nanometer scale, and with the increase in large raw image datasets generated, improving computational strategies for image segmentation and s ...
Berlin2024Differentially private multi-agent constraint optimization
Boi Faltings, Sujit Prakash Gujar, Aleksei Triastcyn, Sankarshan Damle
Distributed constraint optimization (DCOP) is a framework in which multiple agents with private constraints (or preferences) cooperate to achieve a common goal optimally. DCOPs are applicable in several multi-agent coordination/allocation problems, such as ...
Dordrecht2024A Combination Technique for Optimal Control Problems Constrained by Random PDEs
We present a combination technique based on mixed differences of both spatial approximations and quadrature formulae for the stochastic variables to solve efficiently a class of optimal control problems (OCPs) constrained by random partial differential equ ...
2024