![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Matthieu Gallet
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Matthieu Gallet
, Abdourrahmane M. Atto
, Fatima Karbou
, Emmanuel Trouvé
:
Wet Snow Detection From Satellite SAR Images by Machine Learning With Physical Snowpack Model Labeling. IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens. 17: 2901-2917 (2024) - [c15]Matthieu Gallet, Ammar Mian, Abdourrahmane M. Atto:
Renyi Divergences Learning for explainable classification of SAR Image Pairs. ICASSP 2024: 7445-7449 - 2023
- [j3]Matthieu Gallet
, Ammar Mian
, Guillaume Ginolhac
, Esa Ollila
, Nickolas Stelzenmuller:
New Robust Sparse Convolutional Coding Inversion Algorithm for Ground Penetrating Radar Images. IEEE Trans. Geosci. Remote. Sens. 61: 1-14 (2023) - [c14]Suvrat Kaushik
, Matthieu Gallet
, Yajing Yan, Abdourrahmane M. Atto, Ludovic Ravanel, Emmanuel Trouvé:
Temporal Evolution of X and C Band Sar Backscattering In The Mont-Blanc Massif. IGARSS 2023: 207-210 - [c13]Matthieu Gallet
, Abdourrahmane M. Atto, Emmanuel Trouvé, Fatima Karbou:
CNN Classification of Wet Snow by Physical Snowpack Model Labeling. IGARSS 2023: 5351-5354 - [d1]Matthieu Gallet
, Fatima Karbou
, Abdourrahmane M. Atto
, Emmanuel Trouvé
:
LSD4WSD VX: An Open Dataset for Wet Snow Detection with SAR Data and Physical Labelling - Full Analysis Version. IEEE DataPort, 2023 - 2022
- [c12]Matthieu Gallet
, Ammar Mian, Guillaume Ginolhac, Nickolas Stelzenmuller:
Classification of GPR Signals Via Covariance Pooling on CNN Features Within a Riemannian Framework. IGARSS 2022: 365-368
2010 – 2019
- 2015
- [c11]Hanbin Wang, Tangwei Hsu, Matthieu Gallet, Florent Maye:
Doggy Drone: A low cost ball catching system based on the AR.Drone quadrotor and Xtion PRO. ICIA 2015: 2853-2858 - 2014
- [j2]Anne Benoit
, Matthieu Gallet, Bruno Gaujal, Yves Robert
:
Computing the Throughput of Probabilistic and Replicated Streaming Applications. Algorithmica 69(4): 925-957 (2014) - 2010
- [c10]Matthieu Gallet, Nezih Yigitbasi, Bahman Javadi, Derrick Kondo, Alexandru Iosup
, Dick H. J. Epema:
A Model for Space-Correlated Failures in Large-Scale Distributed Systems. Euro-Par (1) 2010: 88-100 - [c9]Henri Casanova, Matthieu Gallet, Frédéric Vivien
:
Non-clairvoyant Scheduling of Multiple Bag-of-Tasks Applications. Euro-Par (1) 2010: 168-179 - [c8]Nezih Yigitbasi, Matthieu Gallet, Derrick Kondo, Alexandru Iosup
, Dick H. J. Epema:
Analysis and modeling of time-correlated failures in large-scale distributed systems. GRID 2010: 65-72 - [c7]Matthieu Gallet, Mathias Jacquelin
, Loris Marchal
:
Scheduling complex streaming applications on the Cell processor. IPDPS Workshops 2010: 1-8 - [c6]Anne Benoit
, Fanny Dufossé, Matthieu Gallet, Yves Robert
, Bruno Gaujal:
Computing the throughput of probabilistic and replicated streaming applications. SPAA 2010: 166-175
2000 – 2009
- 2009
- [b1]Matthieu Gallet:
Steady-State Scheduling of Task Graphs onto Heterogeneous Platforms. (Ordonnancement en régime permanent sur plates-formes hétérogènes). École normale supérieure de Lyon, France, 2009 - [c5]Anne Benoit
, Matthieu Gallet, Bruno Gaujal, Yves Robert:
Computing the Throughput of Replicated Workflows on Heterogeneous Platforms. ICPP 2009: 204-211 - [c4]Matthieu Gallet, Loris Marchal
, Frédéric Vivien
:
Efficient scheduling of task graph collections on heterogeneous resources. IPDPS 2009: 1-11 - [p1]Matthieu Gallet, Yves Robert, Frédéric Vivien:
Divisible Load Scheduling. Introduction to Scheduling 2009: 187-218 - 2008
- [j1]Matthieu Gallet, Yves Robert
, Frédéric Vivien
:
Comments on "Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks". J. Parallel Distributed Comput. 68(7): 1021-1031 (2008) - [c3]Matthieu Gallet, Loris Marchal
, Frédéric Vivien
:
Allocating Series of Workflows on Computing Grids. ICPADS 2008: 48-55 - 2007
- [c2]Matthieu Gallet, Yves Robert
, Frédéric Vivien
:
Scheduling multiple divisible loads on a linear processor network. ICPADS 2007: 1-8 - [c1]Matthieu Gallet, Yves Robert, Frédéric Vivien
:
Scheduling Communication Requests Traversing a Switch: Complexity and Algorithms. PDP 2007: 39-46 - [i2]Matthieu Gallet, Yves Robert, Frédéric Vivien:
Scheduling multiple divisible loads on a linear processor network. CoRR abs/0706.4038 (2007) - [i1]Matthieu Gallet, Yves Robert, Frédéric Vivien:
Comments on "Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks". CoRR abs/cs/0702066 (2007)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-16 00:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint