default search action
Riccardo La Grassa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j11]Ignazio Gallo, Anwar Ur Rehman, Ramin Heidarian Dehkordi, Nicola Landro, Riccardo La Grassa, Mirco Boschetti:
Deep Object Detection of Crop Weeds: Performance of YOLOv7 on a Real Case Dataset from UAV Images. Remote. Sens. 15(2): 539 (2023) - [j10]Riccardo La Grassa, Gabriele Cremonese, Ignazio Gallo, Cristina Re, Elena Martellato:
YOLOLens: A Deep Learning Model Based on Super-Resolution to Enhance the Crater Detection of the Planetary Surfaces. Remote. Sens. 15(5): 1171 (2023) - 2022
- [j9]Riccardo La Grassa, Ignazio Gallo, Nicola Landro:
σ2R loss: A weighted loss by multiplicative factors using sigmoidal functions. Neurocomputing 470: 217-225 (2022) - [j8]Nicola Landro, Ignazio Gallo, Riccardo La Grassa, Edoardo Federici:
Two New Datasets for Italian-Language Abstractive Text Summarization. Inf. 13(5): 228 (2022) - [j7]Riccardo La Grassa, Ignazio Gallo, Nicola Landro:
OCmst: One-class novelty detection using convolutional neural network and minimum spanning trees. Pattern Recognit. Lett. 155: 114-120 (2022) - [j6]Riccardo La Grassa, Cristina Re, Gabriele Cremonese, Ignazio Gallo:
Hyperspectral Data Compression Using Fully Convolutional Autoencoder. Remote. Sens. 14(10): 2472 (2022) - [j5]Riccardo La Grassa, Ignazio Gallo, Cristina Re, Gabriele Cremonese, Nicola Landro, Claudio Pernechele, Emanuele Simioni, Mattia Gatti:
An Adversarial Generative Network Designed for High-Resolution Monocular Depth Estimation from 2D HiRISE Images of Mars. Remote. Sens. 14(18): 4619 (2022) - 2021
- [j4]Nicola Landro, Ignazio Gallo, Riccardo La Grassa:
Combining Optimization Methods Using an Adaptive Meta Optimizer. Algorithms 14(6): 186 (2021) - [j3]Nicola Landro, Ignazio Gallo, Riccardo La Grassa:
Is One Teacher Model Enough to Transfer Knowledge to a Student Model? Algorithms 14(11): 334 (2021) - [j2]Riccardo La Grassa, Ignazio Gallo, Nicola Landro:
Learn class hierarchy using convolutional neural networks. Appl. Intell. 51(10): 6622-6632 (2021) - [j1]Ignazio Gallo, Riccardo La Grassa, Nicola Landro, Mirco Boschetti:
Sentinel 2 Time Series Analysis with 3D Feature Pyramid Network and Time Domain Class Activation Intervals for Crop Mapping. ISPRS Int. J. Geo Inf. 10(7): 483 (2021) - [c9]Riccardo La Grassa, Ignazio Gallo, Nicola Landro:
EnGraf-Net: Multiple Granularity Branch Network with Fine-Coarse Graft Grained for Classification Task. CAIP (1) 2021: 393-402 - [c8]Riccardo La Grassa, Ignazio Gallo, Calogero Vetro, Nicola Landro:
Learning to Navigate in the Gaussian Mixture Surface. CAIP (1) 2021: 414-423 - 2020
- [c7]Riccardo La Grassa, Ignazio Gallo, Nicola Landro:
Dynamic Decision Boundary for One-class Classifiers applied to non-uniformly Sampled Data. DICTA 2020: 1-7 - [c6]Ignazio Gallo, Shah Nawaz, Nicola Landro, Riccardo La Grassa:
Visual Word Embedding for Text Classification. ICPR Workshops (6) 2020: 339-352 - [c5]Ignazio Gallo, Gabriele Magistrali, Nicola Landro, Riccardo La Grassa:
Improving the Efficient Neural Architecture Search via Rewarding Modifications. IVCNZ 2020: 1-6 - [c4]Ignazio Gallo, Gianmarco Ria, Nicola Landro, Riccardo La Grassa:
Image and Text fusion for UPMC Food-101 using BERT and CNNs. IVCNZ 2020: 1-6 - [i9]Riccardo La Grassa, Ignazio Gallo, Nicola Landro:
OCmst: One-class Novelty Detection using Convolutional Neural Network and Minimum Spanning Trees. CoRR abs/2003.13524 (2020) - [i8]Riccardo La Grassa, Ignazio Gallo, Nicola Landro:
Dynamic Decision Boundary for One-class Classifiers applied to non-uniformly Sampled Data. CoRR abs/2004.02273 (2020) - [i7]Nicola Landro, Ignazio Gallo, Riccardo La Grassa:
Can a powerful neural network be a teacher for a weaker neural network? CoRR abs/2005.00393 (2020) - [i6]Riccardo La Grassa, Ignazio Gallo, Nicola Landro:
Learn Class Hierarchy using Convolutional Neural Networks. CoRR abs/2005.08622 (2020) - [i5]Riccardo La Grassa, Ignazio Gallo, Nicola Landro:
σ2R Loss: a Weighted Loss by Multiplicative Factors using Sigmoidal Functions. CoRR abs/2009.08796 (2020) - [i4]Nicola Landro, Ignazio Gallo, Riccardo La Grassa:
Mixing ADAM and SGD: a Combined Optimization Method. CoRR abs/2011.08042 (2020)
2010 – 2019
- 2019
- [c3]Riccardo La Grassa, Ignazio Gallo, Alessandro Calefati, Dimitri Ognibene:
Binary Classification Using Pairs of Minimum Spanning Trees or N-Ary Trees. CAIP (2) 2019: 365-376 - [c2]Ignazio Gallo, Shah Nawaz, Alessandro Calefati, Riccardo La Grassa, Nicola Landro:
Picture What You Read. DICTA 2019: 1-7 - [c1]Riccardo La Grassa, Ignazio Gallo, Alessandro Calefati, Dimitri Ognibene:
A Classification Methodology Based on Subspace Graphs Learning. DICTA 2019: 1-8 - [i3]Riccardo La Grassa, Ignazio Gallo, Alessandro Calefati, Dimitri Ognibene:
Binary Classification using Pairs of Minimum Spanning Trees or N-ary Trees. CoRR abs/1906.06090 (2019) - [i2]Riccardo La Grassa, Ignazio Gallo, Alessandro Calefati, Dimitri Ognibene:
A Classification Methodology based on Subspace Graphs Learning. CoRR abs/1909.04078 (2019) - [i1]Ignazio Gallo, Shah Nawaz, Alessandro Calefati, Riccardo La Grassa, Nicola Landro:
Picture What you Read. CoRR abs/1909.05663 (2019)
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-05-08 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint