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

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

The unifying theme of this thesis are decision trees. Given a boolean function

f

and an input

x

, a decision tree computes the value

f(x)

by repeatedly querying bits of

x

. Our work is two-fold. On one hand, we investigate direct sums and other relat ...

Demographic fairness or equity is a crucial aspect of machine learning models, particularly in critical domains such as healthcare, where errors can have severe consequences. A fair model avoids making distinctions between groups with different sensitive o ...

Laser material processing (LMP) has revolutionized modern manufacturing, emerging as a cornerstone technology valued for its precision, speed, and versatility, especially in high-stakes sectors like aerospace, automotive, and medical device production. Des ...

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

Topological Weyl semimetals represent a novel class of nontrivial materials, where band crossings with linear dispersions take place at generic momenta across reciprocal space. These crossings give rise to low -energy properties akin to those of Weyl fermi ...

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

This Ph.D. thesis unveils the unique topological phenomena occurring in such networks, focusing on the intricate interplay between their Floquet topology, the presence of disorder, and their unitary scattering at microscopic and macroscopic scales. Using t ...

In this thesis we study stability from several viewpoints. After covering the practical importance, the rich history and the ever-growing list of manifestations of stability, we study the following. (i) (Statistical identification of stable dynamical syste ...

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

We propose an adaptive quantum algorithm to prepare accurate variational time evolved wave functions. The method is based on the projected variational quantum dynamics (pVQD) algorithm, that performs a global optimization with linear scaling in the number ...

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

Graph neural networks (GNNs) have demonstrated promising performance across various chemistry-related tasks. However, conventional graphs only model the pairwise connectivity in molecules, failing to adequately represent higher order connections, such as m ...

Hyperbolic lattices are a new type of synthetic materials based on regular tessellations in non-Euclidean spaces with constant negative curvature. While so far, there has been several theoretical investigations of hyperbolic topological media, experimental ...

The sum-of-squares (SOS) approximation method is a technique used in optimization problems to derive lower bounds on the optimal value of an objective function. By representing the objective function as a sum of squares in a feature space, the SOS method t ...

Sample efficiency is a fundamental challenge in de novo molecular design. Ideally, molecular generative models should learn to satisfy a desired objective under minimal calls to oracles (computational property predictors). This problem becomes more apparen ...

In this paper, we propose an analytical stochastic dynamic programming (SDP) algorithm to address the optimal management problem of price-maker community energy storage. As a price-maker, energy storage smooths price differences, thus decreasing energy arb ...

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

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

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

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

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

Chat with Graph Search

The Power of Decision Trees for Composition and Search Problems

Optimizing fairness and utility in healthcare machine learning models

Toward Autonomous Laser Manufacturing: Solving Key Challenges in Optimization, Monitoring, and Control

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

High-throughput screening of Weyl semimetals

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

Topological photonic transport in disordered scattering networks

Stability: a search for structure

Gibbs sampling the posterior of neural networks

Adaptive projected variational quantum dynamics

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

Molecular hypergraph neural networks

Anomalous and Chern topological waves in hyperbolic networks

Theory and applications of the sum-of-squares technique

Augmented Memory: Sample-Efficient Generative Molecular Design with Reinforcement Learning

Energy Management of Price-Maker Community Energy Storage by Stochastic Dynamic Programming

The Two Times Problem: Where Is the Problem?

Performing and Detecting Backdoor Attacks on Face Recognition Algorithms

Results on Sparse Integer Programming and Geometric Independent Sets

Augmented Lagrangian Methods for Provable and Scalable Machine Learning