Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Anneau euclidien

Publications associées (30)

The multivariate Serre conjecture ring

Luc Guyot

It is well-known that for any integral domain R, the Serre conjecture ring R(X), i.e., the localization of the univariate polynomial ring R[X] at monic polynomials, is a Bezout domain of Krull dimension

Academic Press Inc Elsevier Science2023

Dense Packings via Lifts of Codes to Division Rings

Vlad Serban, Nihar Prakash Gargava

obtain algorithmically effective versions of the dense lattice sphere packings constructed from orders in Q-division rings by the first author. The lattices in question are lifts of suitable codes from prime characteristic to orders O in Q-division rings a ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Improving Object Detection under Domain Shifts

Vidit Vidit

Object detection plays a critical role in various computer vision applications, encompassing domains like autonomous vehicles, object tracking, and scene understanding. These applica- tions rely on detectors that generate bounding boxes around known object ...

EPFL2023

Generalised Implicit Neural Representations

Pierre Vandergheynst, Daniele Grattarola

We consider the problem of learning implicit neural representations (INRs) for signals on non-Euclidean domains. In the Euclidean case, INRs are trained on a discrete sampling of a signal over a regular lattice. Here, we assume that the continuous signal e ...

2022

Contrastive Class-aware Adaptation for Domain Generalization

Mathieu Salzmann

Domain generalization (DG) tackles the problem of learning a model that generalizes to data drawn from a target domain that was unseen during training. A major trend in this area consists of learning a domain-invariant representation by minimizing the disc ...

IEEE2022

Symplectic Model-Reduction with a Weighted Inner Product

Jan Sickmann Hesthaven, Babak Maboudi Afkham

In the recent years, considerable attention has been paid to preserving structures and invariants in reduced basis methods, in order to enhance the stability and robustness of the reduced system. In the context of Hamiltonian systems, symplectic model redu ...

2018

Computer Algebraic Approach to Verification and Debugging of Galois Field Multipliers

Cunxi Yu

The paper presents a novel method to verify and debug gate-level arithmetic circuits implemented in Galois Field arithmetic. The method is based on forward reduction of the specification polynomials of the circuit in GF(2(m)) using GF(2) models of its logi ...

IEEE2018

General Proximal Gradient Method: A Case for Non-Euclidean Norms

Volkan Cevher, Ya-Ping Hsieh, Marwa El Halabi, Cong Bang Vu, Van Quang Nguyen

In this paper, we consider composite convex minimization problems. We advocate the merit of considering Generalized Proximal gradient Methods (GPM) where the norm employed is not Euclidean. To that end, we show the tractability of the general proximity ope ...

2017

On finitely generated modules over quasi-Euclidean rings

Luc Guyot

Let R be a unital commutative ring, and let M be an R-module that is generated by k elements but not less. Let be the subgroup of generated by the elementary matrices. In this paper we study the action of by matrix multiplication on the set of unimodular r ...

Springer Verlag2017

On the fundamental domain of affine Springer fibers

Zongbin Chen

Let G be a connected reductive algebraic group over an algebraically closed field k,gamma is an element of g( k(( epsilon ))) a semisimple regular element, we introduce a fundamental domain F gamma for the affine Springer fibers X gamma. We show that the p ...

Springer Heidelberg2017

On sums of eigenvalues of elliptic operators on manifolds

Joachim Stubbe

We use the averaged variational principle introduced in a recent article on graph spectra [10] to obtain upper bounds for sums of eigenvalues of several partial differential operators of interest in geometric analysis, which are analogues of Kroger's bound ...

European Mathematical Soc2017

Geometric deep learning: going beyond Euclidean data

Pierre Vandergheynst, Michael Bronstein

Many signal processing problems involve data whose underlying structure is non-Euclidean, but may be modeled as a manifold or (combinatorial) graph. For instance, in social networks, the characteristics of users can be modeled as signals on the vertices of ...

2017

Small subset sums

Gergely Ambrus

Let parallel to.parallel to be a norm in R-d whose unit ball is B. Assume that V subset of B is a finite set of cardinality n, with Sigma(v is an element of V) v = 0. We show that for every integer k with 0

Elsevier Science Inc2016

A Multiscale Pyramid Transform for Graph Signals

Pierre Vandergheynst, Mohammadjavad Faraji, David Shuman

Multiscale transforms designed to process analog and discrete-time signals and images cannot be directly applied to analyze high-dimensional data residing on the vertices of a weighted graph, as they do not capture the intrinsic topology of the graph data ...

Institute of Electrical and Electronics Engineers2016

Inhomogeneous minima of mixed signature lattices

Eva Bayer Fluckiger, Martino Borello

We establish an explicit upper bound for the Euclidean minimum of a number field which depends, in a precise manner, only on its discriminant and the number of real and complex embeddings. Such bounds were shown to exist by Davenport and Swinnerton-Dyer ([ ...

Academic Press Inc Elsevier Science2016

Multilinear Low-Rank Tensors on Graphs & Applications

Pierre Vandergheynst, Nauman Shahid, Francesco Grassi

We propose a new framework for the analysis of low- rank tensors which lies at the intersection of spectral graph theory and signal processing. As a first step, we present a new graph based low-rank decomposition which approximates the classical low-rank S ...

2016

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

Space lower bounds for low-stretch greedy embeddings

Christos Kalaitzis

Greedy (geometric) routing is an important paradigm for routing in communication networks. It uses an embedding of the nodes of a network into points of a space (e.g., R-d) equipped with a distance function (e.g., the Euclidean distance l(2)) and uses as a ...

Elsevier Science Bv2016

Obstacles For Splitting Multidimensional Necklaces

Michal Lason

The well-known "necklace splitting theorem" of Alon (1987) asserts that every k-colored necklace can be fairly split into q parts using at most t cuts, provided k(q - 1)

American Mathematical Society (AMS)2015

Learning class-specific descriptors for deformable shapes using localized spectral convolutional networks

Pierre Vandergheynst, Michael Bronstein

In this paper, we propose a generalization of convolutional neural networks (CNN) to non-Euclidean domains for the analysis of deformable shapes. Our construction is based on localized frequency analysis (a generalization of the windowed Fourier transform ...

Wiley-Blackwell2015

Publications associées (30)

American Mathematical Society (AMS)2015

Learning class-specific descriptors for deformable shapes using localized spectral convolutional networks

Pierre Vandergheynst, Michael Bronstein

Wiley-Blackwell2015