Остановите войну!
for scientists:
default search action
Fabio Vitale
- > Home > Persons > Fabio Vitale
Publications
- 2023
- [i15]Stephen Pasteris, Alberto Rumi, Fabio Vitale, Nicolò Cesa-Bianchi:
Sum-max Submodular Bandits. CoRR abs/2311.05975 (2023) - [i14]Yuko Kuroki, Alberto Rumi, Taira Tsuchiya, Fabio Vitale, Nicolò Cesa-Bianchi:
Best-of-Both-Worlds Algorithms for Linear Contextual Bandits. CoRR abs/2312.15433 (2023) - 2019
- [c23]Marco Bressan, Nicolò Cesa-Bianchi, Andrea Paudice, Fabio Vitale:
Correlation Clustering with Adaptive Similarity Queries. NeurIPS 2019: 12510-12519 - [i12]Marco Bressan, Nicolò Cesa-Bianchi, Andrea Paudice, Fabio Vitale:
Correlation Clustering with Adaptive Similarity Queries. CoRR abs/1905.11902 (2019) - 2017
- [c14]Géraud Le Falher, Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale:
On the Troll-Trust Model for Edge Sign Prediction in Social Networks. AISTATS 2017: 402-411 - 2016
- [i6]Géraud Le Falher, Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale:
On the Troll-Trust Model for Edge Sign Prediction in Social Networks. CoRR abs/1606.00182 (2016) - 2013
- [j3]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella:
Random spanning trees and the prediction ofweighted graphs. J. Mach. Learn. Res. 14(1): 1251-1284 (2013) - [i5]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella:
A Linear Time Active Learning Algorithm for Link Classification. CoRR abs/1301.4767 (2013) - [i4]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella:
A Correlation Clustering Approach to Link Classification in Signed Networks. CoRR abs/1301.4769 (2013) - [i3]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella:
Active Learning on Trees and Graphs. CoRR abs/1301.5112 (2013) - [i2]Fabio Vitale, Nicolò Cesa-Bianchi, Claudio Gentile, Giovanni Zappella:
See the Tree Through the Lines: The Shazoo Algorithm. CoRR abs/1301.5160 (2013) - 2012
- [c9]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella:
A Linear Time Active Learning Algorithm for Link Classification. NIPS 2012: 1619-1627 - [c7]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella:
A Correlation Clustering Approach to Link Classification in Signed Networks. COLT 2012: 34.1-34.20 - [i1]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella:
Random Spanning Trees and the Prediction of Weighted Graphs. CoRR abs/1212.5637 (2012) - 2011
- [j2]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale:
Predicting the labels of an unknown graph via adaptive exploration. Theor. Comput. Sci. 412(19): 1791-1804 (2011) - [c6]Fabio Vitale, Nicolò Cesa-Bianchi, Claudio Gentile, Giovanni Zappella:
See the Tree Through the Lines: The Shazoo Algorithm. NIPS 2011: 1584-1592 - 2010
- [c5]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella:
Active Learning on Trees and Graphs. COLT 2010: 320-332 - [c4]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale, Giovanni Zappella:
Random Spanning Trees and the Prediction of Weighted Graphs. ICML 2010: 175-182 - 2009
- [c3]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale:
Learning Unknown Graphs. ALT 2009: 110-125 - [c2]Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale:
Fast and Optimal Prediction on a Labeled Tree. COLT 2009
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-04-11 22:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint