default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancesco Fabris
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j13]Alberto Casagrande, Francesco Fabris, Rossano Girometti:
A prevalence-robust measure of diagnostic test performance. Netw. Model. Anal. Health Informatics Bioinform. 14(1): 2 (2025)- 2024
- [c6]Federico Calandra, Francesco P. Rossi, Francesco Fabris, Marco Bernardo:
Making Algorithmic Stablecoins More Stable: The Terra-Luna Case Study. DLT 2024 - 2022
- [j12]Alberto Casagrande
, Francesco Fabris, Rossano Girometti:
Fifty years of Shannon information theory in assessing the accuracy and agreement of diagnostic tests. Medical Biol. Eng. Comput. 60(4): 941-955 (2022) - 2020
- [j11]Alberto Casagrande, Francesco Fabris, Rossano Girometti:
Beyond kappa: an informational index for diagnostic agreement in dichotomous and multivalue ordered-categorical ratings. Medical Biol. Eng. Comput. 58(12): 3089-3099 (2020) - [c5]Alberto Casagrande, Francesco Fabris, Rossano Girometti:
Extending Information Agreement by Continuity. BIBM 2020: 1432-1439 - [i2]Alberto Casagrande, Francesco Fabris, Rossano Girometti:
Computing Information Agreement. CoRR abs/2008.11701 (2020)
2010 – 2019
- 2019
- [c4]Domenico Cantone, Alberto Casagrande, Francesco Fabris, Eugenio G. Omodeo:
Does Every Recursively Enumerable Set Admit a Finite-Fold Diophantine Representation? CILC 2019: 104-122 - 2018
- [j10]Alberto Casagrande, Joanna Jarmolowska, Marcello Turconi, Pierpaolo Busan, Francesco Fabris, Piero Paolo Battaglini:
PolyMorph: Increasing the Spelling Efficiency of P300 by Selection Matrix PolyMorphism and Sentence-Based Predictions. Int. J. Hum. Comput. Interact. 34(12): 1085-1104 (2018) - 2015
- [j9]Rossano Girometti, Francesco Fabris:
Informational analysis: a Shannon theoretic approach to measure the performance of a diagnostic test. Medical Biol. Eng. Comput. 53(9): 899-910 (2015) - [i1]Alberto Casagrande, Joanna Jarmolowska, Marcello Turconi, Francesco Fabris, Pierpaolo Busan, Piero Paolo Battaglini:
PolyMorph: Increasing P300 Spelling Efficiency by Selection Matrix Polymorphism and Sentence-Based Predictions. CoRR abs/1502.04485 (2015) - 2014
- [j8]Rossano Girometti, Francesco Fabris, Andrea Sgarro, Gloria Zanella, Serena Pullini, Lorenzo Cereser, Giuseppe Como, Chiara Zuiani, Massimo Bazzocchi:
Differentiating Small (≤1 cm) Focal Liver Lesions as Metastases or Cysts by means of Computed Tomography: A Case-Study to Illustrate a Fuzzy Logic-Based Method to Assess the Impact of Diagnostic Confidence on Radiological Diagnosis. Comput. Math. Methods Medicine 2014: 587976:1-587976:9 (2014) - 2013
- [c3]Alberto Casagrande, Joanna Jarmolowska, Marcello Turconi, Francesco Fabris, Piero Paolo Battaglini:
PolyMorph: A P300 Polymorphic Speller. Brain and Health Informatics 2013: 297-306 - 2012
- [j7]Alberto Casagrande, Francesco Fabris:
Family Fingerprints: a Global Approach to Structural Classification. J. Bioinform. Comput. Biol. 10(3) (2012) - 2011
- [c2]Alberto Casagrande, Francesco Fabris:
SCOP family fingerprints: An information theoretic approach to structural classification of protein domains. BIBM Workshops 2011: 416-423
2000 – 2009
- 2007
- [j6]Francesco Fabris, Andrea Sgarro, Alessandro Tossi:
Splitting the BLOSUM Score into Numbers of Biological Significance. EURASIP J. Bioinform. Syst. Biol. 2007 (2007) - 2006
- [c1]Luca Bortolussi, Francesco Fabris, Alberto Policriti:
BuST-Bundled Suffix Trees. IFIP TCS 2006: 91-102 - 2003
- [j5]Francesco Fabris, Myron Curtis:
A Nomenclator Used by propaganda fide during the Chinese rites Controversy. Cryptologia 27(4): 319-338 (2003)
1990 – 1999
- 1999
- [j4]Francesco Fabris, Andrea Sgarro:
On the composition of Tunstall messages. IEEE Trans. Inf. Theory 45(5): 1608-1612 (1999) - 1996
- [j3]Francesco Fabris, Andrea Sgarro, R. Pauletti:
Tunstall adaptive coding and miscoding. IEEE Trans. Inf. Theory 42(6): 2167-2180 (1996) - 1993
- [j2]Francesco Fabris, Giaconno Della Riccia:
An application of the Hopfield model to Huffman codes. IEEE Trans. Inf. Theory 39(3): 1071-1076 (1993) - 1992
- [j1]Francesco Fabris:
Variable-length-to-variable-length source coding: A greedy step-by-step algorithm. IEEE Trans. Inf. Theory 38(5): 1609-1617 (1992)
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 2025-01-10 18:33 CET 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:
