Combinatorial algorithms for wireless information flow

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.

Implanted medical devices (IMDs) have been widely developed to support the monitoring and recording of biological data inside the body or brain. Wirelessly powered IMDs, a subset of implantable electronics, have been proposed to eliminate the limitations r ...

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

The Super-X Divertor (SXD) is an alternative divertor configuration leveraging total flux expansion at the Outer Strike Point (OSP). While the extended 2-Point Model (2PM) predicts facilitated detachment access and control in the SXD configuration, these a ...

Dynamical flow networks serve as macroscopic models for, e.g., transportation networks, queuing networks, and distribution networks. While the flow dynamics in such networks follow the conservation of mass on the links, the outflow from each link is often ...

We study the glass transition by exploring a broad class of kinetic rules that can significantly modify the normal dynamics of supercooled liquids while maintaining thermal equilibrium. Beyond the usual dynamics of liquids, this class includes dynamics in ...

Pyroelectricity in a recently developed all-organic composite electret with a polar polynorbornene-based filler and polydimethylsiloxane (PDMS) matrix has been studied with the help of thermal and dielectric techniques. Measurement of the pyroelectric p co ...

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

Isogeometric analysis is a powerful paradigm which exploits the high smoothness of splines for the numerical solution of high order partial differential equations. However, the tensor-product structure of standard multivariate B-spline models is not well s ...

In this paper, we set the mathematical foundations of the Dynamical Low-Rank Approximation (DLRA) method for stochastic differential equations (SDEs). DLRA aims at approximating the solution as a linear combination of a small number of basis vectors with r ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

Given a hyperelliptic hyperbolic surface S of genus g >= 2, we find bounds on the lengths of homologically independent loops on S. As a consequence, we show that for any lambda is an element of (0, 1) there exists a constant N(lambda) such that every such ...

This paper introduces Wireless IoT-based Noise Cancellation (WINC) which defines a framework for leveraging a wireless network of IoT microphones to enhance active noise cancellation in noise-canceling headphones. The IoT microphones forward ambient noise ...

We revisit the problem max-min degree arborescence, which was introduced by Bateni et al. [STOC'09] as a central special case of the general Santa Claus problem, which constitutes a notorious open question in approximation algorithms. In the former problem ...

Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in an environment wi ...

Reduced-order models are indispensable for multi-query or real-time problems. However, there are still many challenges to constructing efficient ROMs for time-dependent parametrized problems. Using a linear reduced space is inefficient for time-dependent n ...

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

2.5D Systems-on-Package (SoPs) are composed by several chiplets placed on an interposer. They are becoming increasingly popular as they enable easy integration of electronic components in the same package and high fabrication yields. Nevertheless, they int ...

Hydropower plants play a crucial role in the power system facing ambitious renewable energy targets. Due to their inherent controllability, they are well suited to provide flexibility to the grid. However, an increased flexibility provision leads to a prol ...

A kernel method for estimating a probability density function from an independent and identically distributed sample drawn from such density is presented. Our estimator is a linear combination of kernel functions, the coefficients of which are determined b ...

Chimeric antigen receptors (CARs) are synthetic, transmembrane proteins that trigger immune cell signaling following their engagement. They have been first utilized in T cells and later in natural killer (NK) cells to redirect their cytotoxicity toward a s ...

Combinatorial algorithms for wireless information flow

Chattez avec Graph Search

Integrated Wireless Power, Data Communication, and Thermal Sensing System for Autonomous Multisite Brain Implants

A ride time-oriented scheduling algorithm for dial-a-ride problems

Parallel flows as a key component to interpret Super-X divertor experiments

The Strong Integral Input-to-State Stability Property in Dynamical Flow Networks

Testing Theories of the Glass Transition with the Same Liquid but Many Kinetic Rules

Pyroelectricity in poled all-organic polar polynorbornene/polydimethylsiloxane-based stretchable electrets

Approximation Algorithms for Allocation and Network Design

Adaptive isogeometric methods with C-1 (truncated) hierarchical splines on planar multi-patch domains

Dynamical Low-Rank Approximation for Stochastic Differential Equations

Results on Sparse Integer Programming and Geometric Independent Sets

Short homology bases for hyperelliptic hyperbolic surfaces

WINC: A Wireless IoT Network for Multi-Noise Source Cancellation

Better Trees for Santa Claus

Certification of Bottleneck Task Assignment With Shortest Path Criteria

Non-intrusive data-driven reduced-order modeling for time-dependent parametrized problems

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

REMOTE: Re-thinking Task Mapping on Wireless 2.5D Systems-on-Package for Hotspot Removal

Structural impact of the start-up sequence on Pelton turbines lifetime: Analytical prediction and polynomial optimization

Density estimation in RKHS with application to Korobov spaces in high dimensions

Unlocking Hidden Potential: Exploring the Complexities of Signaling in Immune Cell Activation to Optimize CAR Therapy