Concept

Famille (mathématiques)

Publications associées (16)

Succinct ordering and aggregation constraints in algebraic array theories

We discuss two extensions to a recently introduced theory of arrays, which are based on considerations coming from the model theory of power structures. First, we discuss how the ordering relation on the index set can be expressed succinctly by referring t ...

Elsevier Science Inc2024

Combinatory Array Logic with Sums

Rodrigo Raya

We prove an NP upper bound on a theory of integer-indexed integer-valued arrays that extends combi- natory array logic with an ordering relation on the index set and the ability to express sums of elements. We compare our fragment with seven other fragment ...

2023

Hydro-mechanical coupling in porous rocks: hidden dependences to the microstructure?

Lucas Xan Pimienta

While hydro-mechanical coupling in rocks is generally well understood, exotic rock poroelastic responses-such as unexpected dependence to fluid diffusion time and low skeleton moduli-have been reported. Hydro-mechanical coupling, or poroelasticity, explain ...

OXFORD UNIV PRESS2021

Combinatorial presentation of multidimensional persistent homology

Martina Scolamiero

A multifiltration is a functor indexed by Nr that maps any morphism to a monomorphism. The goal of this paper is to describe in an explicit and combinatorial way the natural Nr-graded R[x(1),...x(r)]-module structure on the homology of a multifiltration of ...

Elsevier2017

Learning-based subsampling

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Yen-Huan Li, Luca Baldassarre, Baran Gözcü

The present invention concerns a method of sampling a test signal. The method comprises: acquiring (21) training signals sampled at a plurality of sampling locations; running (23) an optimization procedure for determining an index set of n indices, represe ...

2017

Separation with restricted families of sets

János Pach, Gábor Tardos, Márton Naszódi, Zsolt Langi

Given a finite n-element set X, a family of subsets F subset of 2(X) is said to separate X if any two elements of X are separated by at least one member of F. It is shown that if vertical bar F vertical bar > 2(n-1), then one can select vertical bar log n ...

Academic Press Inc Elsevier Science2016

Learning-Based Compressive Subsampling

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Yen-Huan Li, Luca Baldassarre, Baran Gözcü

The problem of recovering a structured signal

\mathbf{x} \in \mathbb{C}^p

from a set of dimensionality-reduced linear measurements

\mathbf{b} = \mathbf {A}\mathbf {x}

arises in a variety of applications, such as medical imaging, spectroscopy, Fourier o ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Sparse Binary Features for Image Classification

Johann Paratte

In this work a new method for automatic image classification is proposed. It relies on a compact representation of images using sets of sparse binary features. This work first evaluates the Fast Retina Keypoint binary descriptor and proposes imp ...

2013

The Truncated Tracial Moment Problem

Sabine Burgdorf

We present tracial analogs of the classical results of Curto and Fialkow on moment matrices. A sequence of real numbers indexed by words in noncommuting variables with values invariant under cyclic permutations of the indexes, is called a tracial sequence. ...

Theta Foundation2012

Moyennabilité et courbure

Martin Anderegg

As Avez showed (in 1970), the fundamental group of a compact Riemannian manifold of nonpositive sectional curvature has exponential growth if and only if it is not flat. After several generalizations from Gromov, Zimmer, Anderson, Burger and Shroeder, the ...

EPFL2010

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search

Learning-Based Compressive Subsampling

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Yen-Huan Li, Luca Baldassarre, Baran Gözcü

The problem of recovering a structured signal

\mathbf{x} \in \mathbb{C}^p

from a set of dimensionality-reduced linear measurements

\mathbf{b} = \mathbf {A}\mathbf {x}

arises in a variety of applications, such as medical imaging, spectroscopy, Fourier o ...

Ieee-Inst Electrical Electronics Engineers Inc2016