default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancesco Pelosin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Jacopo Bonato, Francesco Pelosin, Luigi Sabetta, Alessandro Nicolosi:
MIND: Multi-Task Incremental Network Distillation. AAAI 2024: 11105-11113- [i10]Emanuele Caruso, Francesco Pelosin, Alessandro Simoni, Marco Boschetti:
Dynamic Label Injection for Imbalanced Industrial Defect Segmentation. CoRR abs/2408.10031 (2024) - 2023
- [c4]Luigi Sabetta, Francesco Pelosin, Giulia Denevi, Alessandro Nicolosi:
Incremental Automatic Image Annotation. Ital-IA 2023: 72-77 - [i9]Francesco Pelosin:
Dissecting Continual Learning a Structural and Data Analysis. CoRR abs/2301.01033 (2023) - [i8]Marco Cotogni, Jacopo Bonato, Luigi Sabetta, Francesco Pelosin, Alessandro Nicolosi:
DUCK: Distance-based Unlearning via Centroid Kinematics. CoRR abs/2312.02052 (2023) - [i7]Jacopo Bonato, Francesco Pelosin, Luigi Sabetta, Alessandro Nicolosi:
MIND: Multi-Task Incremental Network Distillation. CoRR abs/2312.02916 (2023) - 2022
- [c3]Francesco Pelosin, Saurav Jha, Andrea Torsello, Bogdan Raducanu, Joost van de Weijer
:
Towards Exemplar-Free Continual Learning in Vision Transformers: an Account of Attention, Functional and Weight Regularization. CVPR Workshops 2022: 3819-3828 - [c2]Francesco Pelosin, Andrea Torsello:
Smaller is Better: An Analysis of Instance Quantity/Quality Trade-off in Rehearsal-based Continual Learning. IJCNN 2022: 1-8 - [i6]Francesco Pelosin, Saurav Jha, Andrea Torsello, Bogdan Raducanu, Joost van de Weijer:
Towards Exemplar-Free Continual Learning in Vision Transformers: an Account of Attention, Functional and Weight Regularization. CoRR abs/2203.13167 (2022) - [i5]Francesco Pelosin:
Simpler is Better: off-the-shelf Continual Learning Through Pretrained Backbones. CoRR abs/2205.01586 (2022) - 2021
- [i4]Francesco Pelosin, Andrea Gasparetto, Andrea Albarelli, Andrea Torsello:
Unsupervised semantic discovery through visual patterns detection. CoRR abs/2102.12213 (2021) - [i3]Francesco Pelosin, Andrea Torsello:
More Is Better: An Analysis of Instance Quantity/Quality Trade-off in Rehearsal-based Continual Learning. CoRR abs/2105.14106 (2021) - 2020
- [j1]Marco Fiorucci, Francesco Pelosin, Marcello Pelillo:
Separating Structure from Noise in Large Graphs Using the Regularity Lemma. Pattern Recognit. 98 (2020) - [c1]Francesco Pelosin, Andrea Gasparetto, Andrea Albarelli, Andrea Torsello:
Unsupervised Semantic Discovery Through Visual Patterns Detection. S+SSPR 2020: 272-281
2010 – 2019
- 2019
- [i2]Marco Fiorucci, Francesco Pelosin, Marcello Pelillo:
Separating Structure from Noise in Large Graphs Using the Regularity Lemma. CoRR abs/1905.06917 (2019) - 2018
- [i1]Francesco Pelosin:
Graph Compression Using The Regularity Method. CoRR abs/1810.07275 (2018)
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-09-26 00:50 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:
