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

Concept

L (complexité)

Publications associées (30)

An Optimal Space Lower Bound for Approximating MAX-CUT

Mikhail Kapralov

We consider the problem of estimating the value of MAX-CUT in a graph in the streaming model of computation. At one extreme, there is a trivial 2-approximation for this problem that uses only O(log n) space, namely, count the number of edges and output hal ...

ASSOC COMPUTING MACHINERY2019

Distributed Routing and Charging Scheduling Optimization for Internet of Electric Vehicles

Xiaoying Tang

In this paper, we consider an Internet of Electric Vehicles (IoEV) powered by heterogeneous charging facilities in the transportation network. In particular, we take into account the state-of-the-art vehicle-to-grid (V2G) charging and renewable power gener ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Manifold Learning and Optimal Control for Obstacle Avoidance in Autonomous Driving

Colin Neil Jones, Sanket Sanjay Diwale

A novel manifold learning approach is presented to incorporate computationally efficient obstacle avoidance constraints in optimal control algorithms. The method presented provides a significant computational benefit by reducing the number of constraints r ...

2019

Beyond Conventional Security in Sponge-Based Authenticated Encryption Modes

Philipp Svetolik Jovanovic

The Sponge function is known to achieve 2c/2 security, where c is its capacity. This bound was carried over to its keyed variants, such as SpongeWrap, to achieve a min{2c/2,2 kappa} security bound, with kappa the key length. Similarly, many CAESAR competit ...

SPRINGER2019

Compute–Forward Multiple Access (CFMA): Practical Implementations

Michael Christoph Gastpar, Sung Hoon Lim, Jingge Zhu, Erixhen Sula, Adriano Pastore

We present a practical strategy that aims to attain rate points on the dominant face of the multiple access channel capacity using a standard low complexity decoder. This technique is built upon recent theoretical developments of Zhu and Gastpar on compute ...

2019

Time- and Space-Efficient Spatial Data Analytics

Mirjana Pavlovic

Advances in data acquisition technologies and supercomputing for large-scale simulations have led to an exponential growth in the volume of spatial data. This growth is accompanied by an increase in data complexity, such as spatial density, but also by mor ...

EPFL2019

Delay-Power-Rate-Distortion Optimization of Video Representations for Dynamic Adaptive Streaming

Pascal Frossard, Laura Toni

Dynamic adaptive streaming addresses user heterogeneity by providing multiple encoded representations at different rates and/or resolutions for the same video content. For delay-sensitive applications, such as live streaming, there is however a stringent r ...

IEEE2018

Explicit Conditions on Existence and Uniqueness of Load-Flow Solutions in Distribution Networks

Mario Paolone, Jean-Yves Le Boudec, Andrey Bernstein, Cong Wang

We present explicit sufficient conditions that guarantee the existence and uniqueness of the load-flow solution for distribution networks with a generic topology (radial or meshed) modeled with positive sequence equivalents. In the problem, we also account ...

2018

Comparison of L1 and L5 Bands GNSS Signals Acquisition

Cyril Botteron, Jérôme Leclère

Nowadays, civil Global Navigation Satellite System (GNSS) signals are available in both L1 and L5 bands. A receiver does not need to acquire independently the signals in both bands coming from a same satellite, since their carrier Doppler and code delay ar ...

2018

Ramsey-Turan numbers for semi-algebraic graphs

János Pach

A semi-algebraic graph G = (V, E) is a graph where the vertices are points in R-d, and the edge set E is defined by a semi-algebraic relation of constant complexity on V. In this note, we establish the following Ramsey-Turan theorem: for every integer p >= ...

ELECTRONIC JOURNAL OF COMBINATORICS2018