default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Arrestier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c9]Amine Mohamed Belhakimi
, Guillaume Chiron, Florian Arrestier, Ahmad Montaser Awal:
Are Attention blocks better than BiLSTM for text recognition? ICMLT 2023: 201-207- 2021
- [c8]Guillaume Chiron, Florian Arrestier, Ahmad Montaser Awal:
Fast End-to-End Deep Learning Identity Document Detection, Classification and Cropping. ICDAR (4) 2021: 333-347 - 2020
- [c7]Mathieu Percelay, Justine Bonnot, Florian Arrestier, Daniel Ménard:
Polynomial Approximation with Non-Uniform Segmentation for Bivariate Functions. SiPS 2020: 1-6
2010 – 2019
- 2019
- [j5]Daniel Madroñal, Florian Arrestier, Jaime Sancho, Antoine Morvan, Raquel Lazcano, Karol Desnos, Rubén Salvador, Daniel Ménard, Eduardo Juárez Martínez, César Sanz:
PAPIFY: Automatic Instrumentation and Monitoring of Dynamic Dataflow Applications Based on PAPI. IEEE Access 7: 111801-111812 (2019) - [j4]Alexandre Mercat, Florian Arrestier, Maxime Pelcat, Wassim Hamidouche, Daniel Ménard:
On predicting the HEVC intra quad-tree partitioning with tunable energy and rate-distortion. J. Real Time Image Process. 16(1): 161-174 (2019) - [j3]Leonardo Suriano, Florian Arrestier, Alfonso Rodríguez, Julien Heulot, Karol Desnos, Maxime Pelcat, Eduardo de la Torre:
DAMHSE: Programming heterogeneous MPSoCs with hardware acceleration using dataflow-based design space exploration and automated rapid prototyping. Microprocess. Microsystems 71 (2019) - [j2]Florian Arrestier, Karol Desnos, Eduardo Juárez, Daniel Ménard:
Numerical Representation of Directed Acyclic Graphs for Efficient Dataflow Embedded Resource Allocation. ACM Trans. Embed. Comput. Syst. 18(5s): 101:1-101:22 (2019) - [j1]Alexandre Mercat, Florian Arrestier, Maxime Pelcat, Wassim Hamidouche, Daniel Ménard:
Probabilistic Approach Versus Machine Learning for One-Shot Quad-Tree Prediction in an Intra HEVC Encoder. J. Signal Process. Syst. 91(9): 1021-1037 (2019) - [c6]Erwan Nogues, Alexandre Mercat, Florian Arrestier, Maxime Pelcat, Daniel Ménard:
Convex Energy Optimization of Streaming Applications for MPSoCs. ICASSP 2019: 1557-1561 - 2018
- [c5]Alexandre Mercat, Florian Arrestier, Maxime Pelcat, Wassim Hamidouche, Daniel Ménard:
Machine Learning Based Choice of Characteristics for the One-Shot Determination of the HEVC Intra Coding Tree. PCS 2018: 263-267 - [c4]Florian Arrestier, Karol Desnos, Maxime Pelcat, Julien Heulot, Eduardo Juárez, Daniel Ménard:
Delays and states in dataflow models of computation. SAMOS 2018: 47-54 - 2017
- [c3]Alexandre Mercat, Florian Arrestier, Wassim Hamidouche, Maxime Pelcat, Daniel Ménard:
Energy reduction opportunities in an HEVC real-time encoder. ICASSP 2017: 1158-1162 - [c2]Alexandre Mercat, Florian Arrestier, Wassim Hamidouche, Maxime Pelcat, Daniel Ménard:
Constrain the Docile CTUs: An In-Frame complexity allocator for HEVC Intra encoders. ICASSP 2017: 1163-1167 - [c1]Alexandre Mercat, Florian Arrestier, Maxime Pelcat, Wassim Hamidouche, Daniel Ménard:
Prediction of quad-tree partitioning for budgeted energy HEVC encoding. SiPS 2017: 1-6
Coauthor Index
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-05 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
