Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

For any 𝜀 > 0, we prove that 𝑘-Dimensional Matching is hard to approximate within a factor of 𝑘/(12+𝜀) for large 𝑘 unless NP ⊆ BPP. Listed in Karp’s 21 NP-complete problems, 𝑘-Dimensional Matching is a benchmark computational complexity problem which we fi ...

The J–V bump and hysteresis in perovskite solar cells are studied combining measurement and simulation, linking them to spatial collection efficiency changes from ionic charge accumulation, as visualised in external quantum efficiency (EQE) spectra. ...

To constrain cosmological models beyond ACDM, the development of the Euclid analysis pipeline requires simulations that capture the non-linear phenomenology of such models. We present an overview of numerical methods and N-body simulation codes developed t ...

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

In this paper, we study sampling from a posterior derived from a neural network. We propose a new probabilistic model consisting of adding noise at every pre- and post-activation in the network, arguing that the resulting posterior can be sampled using an ...

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 ...

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 ...

The manuscript describes the development of a spatial Agent-based Simulation to model the effect of public policies on private houseowner’s decisions concerning their heating system. The methodology utilized comprises of an empirical survey to determine th ...

Let F be a family of n pairwise intersecting circles in the plane. We show that the number of lenses, that is convex digons, in the arrangement induced by F is at most 2n - 2. This bound is tight. Furthermore, if no two circles in F touch, then the geometr ...

Computer simulations are often used as support material for science education, as they can engage students through inquiry-based learning, promote their active interaction in the experimentation phase, and help them visualize abstract concepts. For instanc ...

The collimation system of the Future Circular Collider, operating with leptons (FCC-ee), must protect not only the experiments against backgrounds, but also the machine itself from beam losses. With a 17.8 MJ stored energy of the electron and positron beam ...

The aircraft assembly system is highly complex involving different stakeholders from multiple domains. The design of such a system requires comprehensive consideration of various industrial scenarios aiming to optimize key performance indicators. Tradition ...

Gruber et al. (2022) offered a framework how to explain "Physical time within human time", solving the 'two times problem: Here, I am asking whether such a problem exists at all. To question the question, I will appeal to neurobiological, evolutionary, and ...

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

We examine the connection of two graph parameters, the size of a minimum feedback arcs set and the acyclic disconnection. A feedback arc set of a directed graph is a subset of arcs such that after deletion the graph becomes acyclic. The acyclic disconnecti ...

Reinforcement learning (RL) has shown promising results for real-time control systems, including the domain of plasma magnetic control. However, there are still significant drawbacks compared to traditional feedback control approaches for magnetic confinem ...

Anthropogenic modification of natural landscapes to urban environments impacts land-atmosphere interactions in the boundary layer. Ample research has demonstrated the effect of such landscape transitions on development of the urban heat island (UHI), but c ...

The field of biometrics, and especially face recognition, has seen a wide-spread adoption the last few years, from access control on personal devices such as phones and laptops, to automated border controls such as in airports. The stakes are increasingly ...

Zoning reform is a crucial tool for cities to adapt to contemporary challenges. However, its implementation remains challenging. Property owners, with a vested interest in the value of their neighborhoods, are sensitive to local developments and the potent ...

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 ...

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Chattez avec Graph Search

Asymptotically Optimal Hardness for 𝑘-Set Packing and 𝑘-Matroid Intersection

Visualising ionic screening in perovskite solar cells: a bumpy ride along the J–V curve

Euclid preparation: LXII. Simulations and non-linearities beyond Lambda cold dark matter. 1. Numerical methods and validation

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Gibbs sampling the posterior of neural networks

The Power of Two Matrices in Spectral Algorithms for Community Recovery

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

Spatial Agent-Based Modelling and Simulation to Evaluate on Public Policies for Energy Transition

A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane

Teacher-Mediated and Student-Led Interaction with a Physics Simulation: Effects on the Learning Experience

Collimation simulations for the FCC-ee

An aircraft assembly process formalism and verification method based on semantic modeling and MBSE

The Two Times Problem: Where Is the Problem?

A ride time-oriented scheduling algorithm for dial-a-ride problems

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al

Towards practical reinforcement learning for tokamak magnetic control

Urban boundary-layer flows in complex terrain: Dynamic interactions during a hot and dry summer season in Phoenix, Arizona

Performing and Detecting Backdoor Attacks on Face Recognition Algorithms

Spatial Modeling for Building Design Evaluation: from Visual Landscape Quality Assessment to Devaluation Risk Estimation

Exact Obstacle Avoidance for Robots in Complex and Dynamic Environments Using Local Modulation