49 citations · 94 across the 10 of their papers we have counts for
14 papers
The k-bit Sensitivity of LZ77
Gabriel Bathie, Paul Huber, Guillaume Lagarde +1
In this paper, we study the sensitivity of the Lempel--Ziv 77 (LZ77) algorithm under multiple substitutions. Akagi, Funakoshi and Inenaga [JIC, 2023] showed that when applying a si…
There is More to Attention: Statistical Filtering Enhances Explanations in Vision Transformers
Meghna P Ayyar, Jenny Benois-Pineau, Akka Zemmari
Explainable AI (XAI) has become increasingly important with the rise of large transformer models, yet many explanation methods designed for CNNs transfer poorly to Vision Transform…
FusWay: Multimodal hybrid fusion approach. Application to Railway Defect Detection
Alexey Zhukov, Jenny Benois-Pineau, Amira Youssef +3
Multimodal fusion is a multimedia technique that has become popular in the wide range of tasks where image information is accompanied by a signal/audio. The latter may not convey h…
Drift Detection: Introducing Gaussian Split Detector
Maxime Fuccellaro, Laurent Simon, Akka Zemmari
Recent research yielded a wide array of drift detectors. However, in order to achieve remarkable performance, the true class labels must be available during the drift detection pha…
3D Convolutional Networks for Action Recognition: Application to Sport Gesture Recognition
Pierre-Etienne Martin, J Benois-Pineau, R Péteri +2
3D convolutional networks is a good means to perform tasks such as video segmentation into coherent spatio-temporal chunks and classification of them with regard to a target taxono…
White Box Methods for Explanations of Convolutional Neural Networks in Image Classification Tasks
Meghna P Ayyar, Jenny Benois-Pineau, Akka Zemmari
In recent years, deep learning has become prevalent to solve applications from multiple domains. Convolutional Neural Networks (CNNs) particularly have demonstrated state of the ar…
Move-to-Data: A new Continual Learning approach with Deep CNNs, Application for image-class recognition
Miltiadis Poursanidis, Jenny Benois-Pineau, Akka Zemmari +2
In many real-life tasks of application of supervised learning approaches, all the training data are not available at the same time. The examples are lifelong image classification o…
Android Inter-App Communication Threats and Detection Techniques
Shweta Bhandari, Wafa Ben Jaballah, Vineeta Jain +5
With the digital breakthrough, smart phones have become very essential component. Mobile devices are very attractive attack surface for cyber thieves as they hold personal details…
Design Patterns in Beeping Algorithms: Examples, Emulation, and Analysis
Arnaud Casteigts, Yves Métivier, John Michael Robson +1
We consider networks of processes which interact with beeps. In the basic model defined by Cornejo and Kuhn (2010), processes can choose in each round either to beep or to listen.…
Counting in One-Hop Beeping Networks
A. Casteigts, Y. Métivier, J. M. Robson +1
We consider networks of processes which interact with beeps. In the basic model defined by Cornejo and Kuhn, which we refer to as the variant, processes can choose in each rou…
Deterministic Leader Election Takes Bit Rounds
Arnaud Casteigts, Yves Métivier, John Michael Robson +1
Leader election is, together with consensus, one of the most central problems in distributed computing. This paper presents a distributed algorithm, called \STT, for electing deter…
On Distributed Computing with Beeps
Y. Métivier, J. M. Robson, A. Zemmari
We consider networks of processes which interact with beeps. Various beeping models are used. The basic one, defined by Cornejo and Kuhn [CK10], assumes that a process can choose e…
Election algorithms with random delays in trees
Jean-François Marckert, Nasser Saheb-Djahromi, Akka Zemmari
The election is a classical problem in distributed algorithmic. It aims to design and to analyze a distributed algorithm choosing a node in a graph, here, in a tree. In this paper,…
A Distributed Enumeration Algorithm and Applications to All Pairs Shortest Paths, Diameter
Y. Métivier, J. M. Robson, A. Zemmari
We consider the standard message passing model; we assume the system is fully synchronous: all processes start at the same time and time proceeds in synchronised rounds. In each ro…