Publications associées à Omnidirectional bats, point-to-plane distances, and the price of uniqueness

Emulating Multimemristive Behavior of Silicon Nanowire-Based Biosensors by Using CMOS-Based Implementations

Sandro Carrara, Junrui Chen, Kapil Bhardwaj

The research presented in this article draws inspiration from previous efforts aimed at replicating the functions of various solid-state memristors using a variety of materials. The memristor circuit emulator serves as a cost-effective tool for circuit des ...

Ieee-Inst Electrical Electronics Engineers Inc2024

Anomalous and Chern topological waves in hyperbolic networks

Romain Christophe Rémy Fleury, Aleksi Antoine Bossart, Haoye Qin, Zhechen Zhang

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

Nature Research2024

Deep Learning for 3D Surface Modelling and Reconstruction

Benoît Alain René Guillard

In recent years, there has been a significant revolution in the field of deep learning, which has demonstrated its effectiveness in automatically capturing intricate patterns from large datasets. However, the majority of these successes in Computer Vision ...

EPFL2023

ISP: Multi-Layered Garment Draping with Implicit Sewing Patterns

Pascal Fua, Benoît Alain René Guillard, Ren Li

Many approaches to draping individual garments on human body models are realistic, fast, and yield outputs that are differentiable with respect to the body shape on which they are draped. However, they are either unable to handle multi-layered clothing, wh ...

2023

Blind as a bat: spatial perception without sight

Frederike Dümbgen

Among our five senses, we rely mostly on audition and vision to perceive an environment. Our ears are able to detect stimuli from all directions, especially from obstructed and far-away objects. Even in smoke, harsh weather conditions, or at night â situ ...

EPFL2021

Shapes From Echoes: Uniqueness From Point-to-Plane Distance Matrices

Martin Vetterli, Ivan Dokmanic, Miranda Krekovic

We study the problem of localizing a configuration of points and planes from the collection of point-to-plane distances. This problem models simultaneous localization and mapping from acoustic echoes as well as the & x201C;structure from sound & x201D; app ...

2020

Coordinate Difference Matrices

Martin Vetterli, Gilles Baechler, Golnooshsadat Elhami, Miranda Krekovic

In many problems such as phase retrieval, molecular biology, source localization, and sensor array calibration, one can measure vector differences between pairs of points and attempt to recover the position of these points; this class of problems is called ...

SIAM PUBLICATIONS2020

Local Vulnerabilities and Global Robustness of Coupled Dynamical Systems on Complex Networks

Melvyn Sandy Tyloo

Coupled dynamical systems are omnipresent in everyday life. In general, interactions between individual elements composing the system are captured by complex networks. The latter greatly impact the way coupled systems are functioning and evolving in time. ...

EPFL2020

UCLID-Net: Single View Reconstruction in Object Space

Pascal Fua, Edoardo Remelli, Benoît Alain René Guillard

Most state-of-the-art deep geometric learning single-view reconstruction approaches rely on encoder-decoder architectures that output either shape parametrizations or implicit representations. However, these representations rarely preserve the Euclidean st ...

2020

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

An Improved Analysis of Local Search for Max-Sum Diversification

Rico Zenklusen, Friedrich Eisenbrand, Alfonso Bolívar Cevallos Manzano

We present new techniques to analyze natural local search algorithms for several variants of the max-sum diversification problem which, in its most basic form, is as follows: given an n-point set X subset of R-d and an integer k, select k points in X so th ...

INFORMS2019

Depth of field extension through polarization aberrations

Alessandro Grosso

This paper focuses on depth of field (DOF) extension through polarization aberrations. The addition of polarizing elements into an optical system allows to exploit the polarization of the incoming light as an additional degree of freedom in the optical sys ...

SPIE-INT SOC OPTICAL ENGINEERING2019

Volumetric untrimming: Precise decomposition of trimmed trivariates into tensor products

Pablo Antolin Sanchez

3D objects, modeled using Computer Aided Geometric Design (CAGD) tools, are traditionally represented using a boundary representation (B-rep), and typically use spline functions to parameterize these boundary surfaces. However, recent development in physic ...

2019

Time-resolved analysis of dynamic graphs: an extended Slepian design

Dimitri Nestor Alice Van De Ville, Raphaël Pierre Liégeois, Ibrahim Merad

Graphs are extensively used to represent networked data. In many applications, especially when considering large datasets, it is a desirable feature to focus the analysis onto specific subgraphs of interest. Slepian theory and its extension to graphs allow ...

SPIE-INT SOC OPTICAL ENGINEERING2019

Hasse principles for multinorm equations

Eva Bayer Fluckiger, Ting-Yu Lee

A classical result of Hasse states that the norm principle holds for finite cyclic extensions of global fields, in other words local norms are global norms. We investigate the norm principle for finite dimensional commutative kale algebras over global fiel ...

2019

Distinct distances between points and lines

Frank de Zeeuw, Adrian Claudiu Valculescu, Shakhar Smorodinsky

We show that for m points and n lines in R-2, the number of distinct distances between the points and the lines is Omega(m(1/5)n(3/5)), as long as m(1/2)

Elsevier Science Bv2018

epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics

Lingxiao Huang, Jian Li

We study the problem of constructing epsilon-coresets for the (k, z)-clustering problem in a doubling metric M(X, d). An epsilon-coreset is a weighted subset S subset of X with weight function w : S -> R->= 0, such that for any k-subset C is an element of ...

IEEE COMPUTER SOC2018

Testing Graph Clusterability: Algorithms and Lower Bounds

Mikhail Kapralov, Aidasadat Mousavifar, Ashish Hari Chiplunkar

We consider the problem of testing graph cluster structure: given access to a graph G = (V, E), can we quickly determine whether the graph can be partitioned into a few clusters with good inner conductance, or is far from any such graph? This is a generali ...

IEEE COMPUTER SOC2018

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b; x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m) and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2018

From Tarski's Plank Problem to Simultaneous Approximation

János Pach, Andrei Kupavskii

A slab (or plank) is the part of the d-dimensional Euclidean space that lies between two parallel hyperplanes. The distance between the these hyperplanes is called the width of the slab. It is conjectured that the members of any infinite family of slabs wi ...

Mathematical Assoc Amer2017