Activities

In this tutorial, we will see how to create and maintain a Python package, especially relying on Cookiecutter, by Audrey Roy Greenfeld, and PyCharm. Even [...]

Supervised learning relies on the existence of training data, typically labeled by human experts. The size and quality of this data has a critical impact [...]

The energy demand in mobile networks is increasing due to the emergence of new technologies and new services with higher requirements (data rates, delays, etc). [...]

I will describe the problem of multiparametric generation (which is #P-complete) and a relaxation of this problem (multiparametric Boltzmann sampling) for which we construct a [...]

Reference: Aizawa, Akiko. "An information-theoretic perspective of tf–idf measures." Information Processing & Management 39.1 (2003): 45-65.

Network Functions Virtualization (NFV) is among the latest network revolutions, bringing flexibility and avoiding network ossification. At the same time, all-software NFV implementations on commodity [...]

Online analytics and real-time data processing in most advanced IoT, scientific, business, and defense applications, rely heavily on the efficient execution of large numbers of [...]

Reference: “Tropical geometry of deep neural networks” (Liwen Zhang, Gregory Naitzat, Lek-Heng Lim, 2018)

In the post-digital era we face the risk of cognitive insufficiency in the attempt of dealing with the increasing exposure to large volume of data [...]

We present a self-stabilizing algorithm that ensures in finite time the gathering of two robots in the non-rigid ASYNC model. To circumvent established impossibility results, [...]

Reference: "Tropical geometry of deep neural networks" (Liwen Zhang, Gregory Naitzat, Lek-Heng Lim, 2018)

Every person is unique and complex.   But can we predict anything about how large groups of people will behave?  In the 1950s the writer [...]

Static and dynamic clustering algorithms are a fundamental tool in any machine learning library. Most of the efforts in developing dynamic machine learning and data mining algorithms [...]

I will present some tools based on generating functions in order to study the limit distributions of some random variables. References: Analytic Combinatorics (Flajolet & [...]

In this presentation, we would like to focus on two well known NP-Hard problems and then provide a combinatorial optimization view  before proposing new and [...]

The paradigm of a Cloud-based RAN (C-RAN) is a key technology that combines the enabling solutions for the 5G requirements in terms of data rate, [...]

Accurately monitoring application performance is becoming more important for Internet Service Providers (ISPs), as users increasingly expect their networks to consistently deliver acceptable application quality. [...]

Lorenzo Maggi will present two approaches of multi-armed bandits: Bayesian and frequentist, based on the papers:  Tsitsiklis, J. N. (1994). A short proof of the [...]

Hardening data protection using multiple methods rather than solely encryption is of paramount importance when considering continuous and powerful attacks to spy private and confidential information. Our research focuses on reinforcing data protection using a combination of data fragmentation, encryption, and dispersion. Each operation participates in the increasing of the protection level. We aim at minimizing the additional processing costs due to data fragmentation and dispersion.

TBA https://youtu.be/QA8ON74zvag

Software Defined Networking (SDN) is gaining momentum with the support of major manufacturers. While it brings flexibility in the management of flows within the data [...]

Lorenzo Maggi will present two approaches of multi-armed bandits: Bayesian and frequentist, based on the papers:  Tsitsiklis, J. N. (1994). A short proof of the [...]

We are on the verge of an industrial revolution that will make cities smarter, industries more efficient and people’s life easier. Urban communication will place [...]

A critical problem with the consensus protocols underlying blockchains is that they do not scale well. As the number of participants trying to achieve consensus [...]

We introduce a novel embedding of directed graphs derived from the singular value decomposition (SVD) of the normalized adjacency matrix. Specifically, we show that, after [...]

Achille Salaün will present a tutorial on Hidden Markov Models based on the reference: Lawrence R. Rabiner, A Tutorial on Hidden Markov Models and Selected Applications in [...]

In the first part of the talk we shall consider game theory as a tool for analyzing and predicting the evolution of the Internet topology. [...]

Céline Comte will present Belief Propagation in Bayesian Networks based on the two references: J. Pearl, Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach. [...]

Graph classification has recently received a lot of attention from various fields of machine learning e.g. kernel methods, sequential modeling or graph embedding. We address [...]

In this talk, we address a very common and practical question for the programmer: what should be the general architecture of our code? In particular, [...]

Learning from data strutured as a graph usually requires to embed this graph in some vector space of low dimension. The most popular technique relies [...]

Edge computing provides a new way to implement services with many unique advantages. While many edge computing solutions have been implemented within different network infrastructures, [...]

Nathan de Lara will present the article Halko, N., Martinsson, P. G., & Tropp, J. A. (2011). Finding structure with randomness: Probabilistic algorithms for constructing [...]

Stochastic network calculus is a tool for computing error bounds on the performance of queueing systems. However, deriving accurate bounds for networks consisting of several [...]

For decades power systems academics have proclaimed the need for real time prices to create a more efficient grid. The rationale is economics 101: proper [...]

The talk is based on the Online Course Convex Optimization by Stephen Boyd and the Book Convex Optimization by Stephen Boyd and Lieven Vandenberghe. Slides [...]

This lecture explores the general problem of explaining the behavior of Artificial Neural Networks (ANN). The goal is to construct a representation which enhances human [...]

In this talk we will discuss optimal control subject to changing conditions (a changing environment). This is an area that recently received a lot of [...]

This tutorial will explain how to easily turn slow Python into fast Python with the numba package. Speed up of X2000 will be demonstrated on [...]

Motivated by the increasing ubiquity of large-scale data collection infrastructures, we investigate how to protect sensitive information in dynamic resource allocation problems. The central question [...]

Abstract: Many learning problems are formulated as minimization of some loss function on a training set of examples. Distributed gradient methods on a cluster are [...]

Modern cities are alive with sensors, such as smartphones, wearables, vehicles, and cameras. Realizing our plans for smart environments of the future necessitates a radical [...]

Workshop LINCS and its Scientific Committee June 19th and 20th, 2018 LINCS  -  23 avenue d’Italie, 4th floor – 75013 Paris Agenda June 19th Welcome [...]

In this talk we will define notions of dimension on unimodular random graphs. The key point in this definition is unimodularity which is used indispensably [...]

Internet interconnections are the means by which networks exchange traffic between one another. These interconnections are typically established in facilities that have known geographic locations, [...]

Machine Learning, as the most successful paradigm of Artificial Intelligence to date, has shown its great potential in restructuring all aspects in our everyday life, [...]

We will talk about the online influence maximization problem in social networks under the independent cascade model. Specifically, we aim to learn the set of [...]

In this talk we introduce a novel information propagation method in Twitter, while maintaining a low computational complexity. The proposed method first employs Joint Complexity, [...]

Social media contain information shared by hundreds of millions of users across the world and provide one of the richest dataset created by human activity. [...]