Concept

Euclidean group

Related publications (23)

Mean value theorems for collections of lattices with a prescribed group of symmetries

Euclidean lattices are mathematical objects of increasing interest in the fields of cryptography and error-correcting codes. This doctoral thesis is a study on high-dimensional lattices with the motivation to understand how efficient they are in terms of b ...

EPFL2024

Equivariant Diffusion for Molecule Generation in 3D

Clément Arthur Yvon Vignac

This work introduces a diffusion model for molecule generation in 3D that is equivariant to Euclidean transformations. Our E(3) Equivariant Diffusion Model (EDM) learns to denoise a diffusion process with an equivariant network that jointly operates on bot ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2022

Unraveling looping efficiency of stochastic Cosserat polymers

Raushan Singh, Giulio Corazza

Understanding looping probabilities, including the particular case of ring closure or cyclization, of fluctuating polymers (e.g., DNA) is important in many applications in molecular biology and chemistry. In a continuum limit the configuration of a polymer ...

AMER PHYSICAL SOC2022

UCLID-Net: Single View Reconstruction in Object Space

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

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

Coordinate Difference Matrices

Martin Vetterli, Gilles Baechler, Miranda Krekovic, Golnooshsadat Elhami

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

An Improved Analysis of Local Search for Max-Sum Diversification

Friedrich Eisenbrand, Rico Zenklusen, 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

3D Steerable CNNs: Learning Rotationally Equivariant Features in Volumetric Data

Mario Geiger

We present a convolutional network that is equivariant to rigid body motions. The model uses scalar-, vector-, and tensor fields over 3D Euclidean space to represent data, and equivariant convolutions to map between such representations. These SE(3)-equiva ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2018

Patching And Weak Approximation In Isometry Groups

Eva Bayer Fluckiger

Let R be a semilocal principal ideal domain. Two algebraic objects over R in which scalar extension makes sense (e.g. quadratic spaces) are said to be of the same genus if they become isomorphic after extending scalars to all completions of R and its fract ...

Amer Mathematical Soc2017

Approximation algorithms for geometric dispersion

Alfonso Bolívar Cevallos Manzano

The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...

EPFL2016

Indoor localization method and system

Martin Vetterli, Reza Parhizkar, Gilles Baechler

An indoor localization method for estimating the location of nodes (n1, n2), at least one node (n1) being connected to at least another node (n2) by at least two different channels (ch1, ch1′), comprising the following steps: measuring a distance between t ...

2015

Relax and Unfold: Microphone Localization with Euclidean Distance Matrices

Martin Vetterli, Ivan Dokmanic, Juri Ranieri

Recent methods for localization of microphones in a microphone array exploit sound sources at a priori unknown locations. This is convenient for ad-hoc arrays, as it requires little additional infrastructure. We propose a flexible localization algorithm by ...

2015

Inter-limb coordination and energy cost in swimming

Kamiar Aminian, Farzin Dadashi, Grégoire Millet, Florent Crettenand

Objectives: This study investigated the relationship between inter-arm coordination and the energy cost of locomotion in front crawl and breaststroke and explored swimmers’ flexibility in adapting their motor organization away from their preferred movement ...

Elsevier2014

Approximate Matrix Multiplication with Application to Linear Embeddings

Anastasios Kyrillidis, Michail Vlachos

In this paper, we study the problem of approximately computing the product of two real matrices. In particular, we analyze a dimensionality-reduction-based approximation algorithm due to Sarlos [1], introducing the notion of nuclear rank as the ratio of th ...

Ieee2014

Scalar masses in general N=2 gauged supergravity theories

Claudio Scrucca, Paul Smyth, Francesca Catino

We readdress the question of whether any universal upper bound exists on the square mass m(2) of the lightest scalar around a supersymmetry breaking vacuum in generic N=2 gauged supergravity theories for a given gravitino mass m(3/2) and cosmological const ...

Springer Nature2014

Incommensurate crystallography without additional dimensions

Philippe Kocian

It is shown that the Euclidean group of translations, when treated as a Lie group, generates translations not only in Euclidean space but on any space, curved or not. Translations are then not necessarily vectors (straight lines); they can be any curve com ...

International Union of Crystallography2013

Fixed points and amenability in non-positive curvature

Nicolas Monod

Consider a proper cocompact CAT(0) space X. We give a complete algebraic characterisation of amenable groups of isometries of X. For amenable discrete subgroups, an even narrower description is derived, implying Q-linearity in the torsion-free case. We est ...

Springer2013

Closing Large Hyperbolic 2g-gons : a Way to Study Hyperelliptic Riemann Surfaces of Genus g

Poincaré's uniformisation theorem says that any Riemann surface is conformally equivalent to a unique (up to isometry) surface of constant Gauss curvature 0, 1 or –1. The (topologically) richest of these three worlds is for curvature –1 formed of hyperboli ...

EPFL2012

Finite Element Method on Riemann Surfaces and Applications to the Laplacian Spectrum

Marc Maintrot

The objective of this PhD thesis is the approximate computation of the solutions of the Spectral Problem associated with the Laplace operator on a compact Riemann surface without boundaries. A Riemann surface can be seen as a gluing of portions of the Hype ...

EPFL2012

Overlap properties of geometric expanders

The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) is an element of (0, 1] such that no matter how we map the vertices of H into R-d, there is a point covered by at least a c(H)-fraction of the simplices induced by the ...

De Gruyter2011

Distributed Sensor Network Localization from Local Connectivity: Performance Analysis for the HOP-TERRAIN Algorithm

Amin Karbasi

This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the localization algorithm MDS-MAP proposed by Y. Shang et al. is able to localiz ...

2010