
Detecting Colorized Images via Convolutional Neural Networks: Toward High Accuracy and Good Generalization
Image colorization achieves more and more realistic results with the inc...
read it

Dynamic MultiScale Semantic Segmentation based on Dilated Convolutional Networks
Semantic segmentation requires methods capable of learning highlevel fe...
read it

Convergence and Stability of Graph Convolutional Networks on Large Random Graphs
We study properties of Graph Convolutional Networks (GCNs) by analyzing ...
read it

Coupled Ensembles of Neural Networks
We investigate in this paper the architecture of deep convolutional netw...
read it

Multivariate Temporal Dictionary Learning for EEG
This article addresses the issue of representing electroencephalographic...
read it

Hyperspectral Unmixing Overview: Geometrical, Statistical, and Sparse RegressionBased Approaches
Imaging spectrometers measure electromagnetic energy scattered in their ...
read it

On some Graphs with a Unique Perfect Matching
We show that deciding whether a given graph G of size m has a unique per...
read it

Efficient and Playful Tools to Teach Unix to New Students
Teaching Unix to new students is a common tasks in many higher schools. ...
read it

Separation choosability and dense bipartite induced subgraphs
We study a restricted form of list colouring, for which every pair of li...
read it

Distributed coloring in sparse graphs with fewer colors
This paper is concerned with efficiently coloring sparse graphs in the d...
read it

EPTAS for Max Clique on Disks and Unit Balls
We propose a polynomialtime algorithm which takes as input a finite set...
read it

Least conflict choosability
Given a multigraph, suppose that each vertex is given a local assignment...
read it

Largedimensional behavior of regularized Maronna's Mestimators of covariance matrices
Robust estimators of large covariance matrices are considered, comprisin...
read it

Handwriting styles: benchmarks and evaluation metrics
Evaluating the style of handwriting generation is a challenging problem,...
read it

Reconfiguration of graphs with connectivity constraints
A graph G realizes the degree sequence S if the degrees of its vertices ...
read it

Distributed coloring of graphs with an optimal number of colors
This paper studies sufficient conditions to obtain efficient distributed...
read it

Online Localization and Tracking of Multiple Moving Speakers in Reverberant Environments
This paper addresses the problem of online multiplespeaker localization...
read it

Polynomialtime algorithms for 2edgeconnected subgraphs on fundamental classes by topdown coloring
Finding the exact integrality gap α for the LP relaxation of the 2edge...
read it

Rounding semidefinite programs for largedomain problems via Brownian motion
We present a new simple method for rounding a semidefinite programming r...
read it

Style Transfer and Extraction for the Handwritten Letters Using Deep Learning
How can we learn, transfer and extract handwriting styles using deep neu...
read it

Strengthening the MurtySimon conjecture on diameter 2 critical graphs
A graph is diameter2critical if its diameter is 2 but the removal of a...
read it

Local approximation of the Maximum Cut in regular graphs
This paper is devoted to the distributed complexity of finding an approx...
read it

A polynomial version of Cereceda's conjecture
Let k and d be such that k > d+2. Consider two kcolourings of a ddegen...
read it

Efficient constructions of convex combinations for 2edgeconnected subgraphs on fundamental classes
Finding the exact integrality gap α for the LP relaxation of the 2edge...
read it

Planar graphs have bounded nonrepetitive chromatic number
A colouring of a graph is "nonrepetitive" if for every path of even orde...
read it

An Introduction to Deep Morphological Networks
The recent impressive results of deep learningbased methods on computer...
read it

Quantization in Compressive Sensing: A Signal Processing Approach
Influence of the finitelength registers and quantization effects on the...
read it

Linear transformations between colorings in chordal graphs
Let k and d be such that k > d+2. Consider two kcolorings of a ddegene...
read it

A global constraint for the capacitated singleitem lotsizing problem
The goal of this paper is to set a constraint programming framework to s...
read it

Towards improving Christofides algorithm for halfinteger TSP
We study the traveling salesman problem (TSP) in the case when the objec...
read it

Hyperspectral pansharpening: a review
Pansharpening aims at fusing a panchromatic image with a multispectral o...
read it

Tree search algorithms for the Sequential Ordering Problem
We present a study of several generic tree search techniques applied to ...
read it

A New Resynchronization Method based Multimodal Fusion for Automatic Continuous Cued Speech Recognition
Cued Speech (CS) is an augmented lip reading complemented by hand coding...
read it

A note on the simultaneous edge coloring
Let G=(V,E) be a graph. A (proper) kedgecoloring is a coloring of the ...
read it

Packing and covering balls in graphs excluding a minor
We prove that for every integer t> 1 there exists a constant c_t such th...
read it

Resynchronization using the Hand Preceding Model for Multimodal Fusion in Automatic Continuous Cued Speech Recognition
Cued Speech (CS) is an augmented lip reading complemented by hand coding...
read it

Integer Plane Multiflow Maximisation:FlowCut Gap and OneQuarterApproximation
In this paper, we bound the integrality gap and the approximation ratio ...
read it

HighResolution Speaker Counting In Reverberant Rooms Using CRNN With Ambisonics Features
Speaker counting is the task of estimating the number of people that are...
read it

An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
In this article, we present the anytime tree search algorithm we designe...
read it

Graphbased fusion for change detection in multispectral images
In this paper we address the problem of change detection in multispectr...
read it

PackingSolver: a solver for Packing Problems
In this article, we introduce PackingSolver, a new solver for twodimens...
read it

An algorithmic framework for colouring locally sparse graphs
We develop an algorithmic framework for graph colouring that reduces the...
read it

An anytime tree search algorithm for twodimensional two and threestaged guillotine packing problems
[libralesso_anytime_2020] proposed an anytime tree search algorithm for ...
read it

The (2,k)connectivity augmentation problem: Algorithmic aspects
Durand de Gevigney and Szigeti <cit.> have recently given a minmax theo...
read it

On the use of DataDriven Cost Function Identification in Parametrized NMPC
In this paper, a framework with complete numerical investigation is prop...
read it

CrossAttention in Coupled Unmixing Nets for Unsupervised Hyperspectral SuperResolution
The recent advancement of deep learning techniques has made great progre...
read it

Coupled Convolutional Neural Network with Adaptive Response Function Learning for Unsupervised Hyperspectral SuperResolution
Due to the limitations of hyperspectral imaging systems, hyperspectral i...
read it

What the Future Brings: Investigating the Impact of Lookahead for Incremental Neural TTS
In incremental text to speech synthesis (iTTS), the synthesizer produces...
read it

Connectivity of orientations of 3edgeconnected graphs
We attempt to generalize a theorem of NashWilliams stating that a graph...
read it

Enhancing ensemble learning and transfer learning in multimodal data analysis by adaptive dimensionality reduction
Modern data analytics take advantage of ensemble learning and transfer l...
read it
Grenoble Institute of Technology
Grenoble INP also has a twoyear preparatory class programme, an adult education department, as well as 21 laboratories and a graduate school in Engineering Sciences.