Achieving Linear Scaling with Interference Alignment

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.

Visual Focus of Attention (VFOA) estimation in conversation is challenging as it relies on difficult to estimate information (gaze) combined with scene features like target positions and other contextual information (speaking status) allowing to disambigua ...

Consider F is an element of C(RxX,Y) such that F(lambda, 0) = 0 for all lambda is an element of R, where X and Y are Banach spaces. Bifurcation from the line Rx{0} of trivial solutions is investigated in cases where F(lambda, center dot ) need not be Frech ...

In this paper, we explore the use of channel state information (CSI) from a WiFi system to estimate the breathing rate of a person in a room. In order to extract WiFi CSI components that are sensitive to breathing, we propose to consider the delay domain c ...

Functional time series is a temporally ordered sequence of not necessarily independent random curves. While the statistical analysis of such data has been traditionally carried out under the assumption of completely observed functional data, it may well ha ...

Open-domain chatbots that can engage in a conversation on any topic received significant attention in the last several years, which opened opportunities for studying user interaction with them. Drawing from reviews of chatbots posted on Google Play, we exp ...

In every dimension d >= 2, we give an explicit formula that expresses the values of any Schwartz function on R-d only in terms of its restrictions, and the restrictions of its Fourier transform, to all origin-centered spheres whose radius is the square roo ...

Nowadays, search engines, social media or news aggregators are the preferred services for news access. Aggregation is mostly based on artificial intelligence technologies raising a new challenge: Trust has been ranked as the most important factor for media ...

Failures far away from a user should intuitively be less likely to affect that user. Today's ecosystem miserably fails this test, however, despite high-availability best practices. Correlated and cascading failures – triggered by misconfigurations, bugs, a ...

We study a fixed point property for linear actions of discrete groups on weakly complete convex proper cones in locally convex topological vector spaces. We search to understand the class of discrete groups which enjoys this property and we try to generali ...

In this paper, we describe a method to tackle data sparsity and create recommendations in domains with limited knowledge about user preferences. We expand the variational autoencoder collaborative filtering from a single-domain to a multi-domain setting. T ...

Achieving Linear Scaling with Interference Alignment

Chat with Graph Search

Visual Focus of Attention Estimation in 3D Scene with an Arbitrary Number of Targets

Global bifurcation at isolated singular points of the Hadamard derivative

ComplexBeat: Breathing Rate Estimation from Complex CSI

Sparsely Observed Functional Time Series: Theory and Applications

User Expectations of Conversational Chatbots Based on Online Reviews

Fourier Interpolation From Spheres

Trust Indicators and Explainable AI: A Study on User Perceptions

Immunizing Systems from Distant Failures by Limiting Lamport Exposure

Invariant Integrals on Topological Groups and Applications

Recommending Burgers based on Pizza Preferences: Addressing Data Sparsity with a Product of Experts