Publications related to Ultrafilter

Fourier non-uniqueness sets from totally real number fields

Let K be a totally real number field of degree n >= 2. The inverse different of K gives rise to a lattice in Rn. We prove that the space of Schwartz Fourier eigenfunctions on R-n which vanish on the "component-wise square root" of this lattice, is infinite ...

EUROPEAN MATHEMATICAL SOC-EMS2022

Extending Boolean Methods for Scalable Logic Synthesis

Giovanni De Micheli, Mathias Soeken, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù, Eleonora Testa

In recent years, Boolean methods in logic synthesis have been drawing the attention of EDA researchers due to the continuous push to advance quality of results. Boolean methods require high computational cost, as they rely on complete functional properties ...

2020

Improvements to Boolean resynthesis

Giovanni De Micheli, Mathias Soeken, Luca Gaetano Amarù

In electronic design automation Boolean resynthesis techniques are increasingly used to improve the quality of results where algebraic methods hit local minima Boolean methods rely on complete functional properties of a logic circuit, preferably including ...

IEEE2018

Dynamics of functional connectivity at high spatial resolution reveal long-range interactions and fine-scale organization

Dimitri Nestor Alice Van De Ville, Maria Giulia Preti

Dynamic functional connectivity (dFC) derived from resting-state functional magnetic resonance imaging sheds light onto moment-to-moment reconfigurations of large-scale functional brain networks. Due to computational limits, connectivity is typically compu ...

Nature Publishing Group2017

Sequences with Minimal Time-Frequency Uncertainty

Martin Vetterli, Reza Parhizkar, Yann Barbotin

A central problem in signal processing and communications is to design signals that are compact both in time and frequency. Heisenberg's uncertainty principle states that a given function cannot be arbitrarily compact both in time and frequency, defining a ...

Elsevier2015

Sequences with Minimal Time-Frequency Spreads

Martin Vetterli, Reza Parhizkar, Yann Barbotin

For a given time or frequency spread, one can always find continuous- time signals, which achieve the Heisenberg uncertainty principle bound. This is known, however, not to be the case for discrete-time sequences; only widely spread sequences asymptoticall ...

Ieee2013

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.

Ultrafilter

Fourier non-uniqueness sets from totally real number fields

Extending Boolean Methods for Scalable Logic Synthesis

Improvements to Boolean resynthesis

Dynamics of functional connectivity at high spatial resolution reveal long-range interactions and fine-scale organization

Sequences with Minimal Time-Frequency Uncertainty

Sequences with Minimal Time-Frequency Spreads

Euclidean Distance Matrices

Graph Chatbot

Chat with Graph Search

Fourier non-uniqueness sets from totally real number fields

Sequences with Minimal Time-Frequency Uncertainty

Sequences with Minimal Time-Frequency Spreads

Extending Boolean Methods for Scalable Logic Synthesis

Dynamics of functional connectivity at high spatial resolution reveal long-range interactions and fine-scale organization

Improvements to Boolean resynthesis

Euclidean Distance Matrices