default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheodore Vasiloudis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Da Zheng
, Xiang Song, Qi Zhu, Jian Zhang, Theodore Vasiloudis, Runjie Ma, Houyu Zhang, Zichen Wang, Soji Adeshina, Israt Nisa, Alejandro Mottini, Qingjun Cui, Huzefa Rangwala, Belinda Zeng, Christos Faloutsos, George Karypis:
GraphStorm: All-in-one Graph Machine Learning Framework for Industry Applications. KDD 2024: 6356-6367- [i6]Da Zheng, Xiang Song, Qi Zhu, Jiani Zhang, Theodore Vasiloudis, Runjie Ma, Houyu Zhang, Zichen Wang, Soji Adeshina, Israt Nisa, Alejandro Mottini, Qingjun Cui, Huzefa Rangwala, Belinda Zeng, Christos Faloutsos, George Karypis:
GraphStorm: all-in-one graph machine learning framework for industry applications. CoRR abs/2406.06022 (2024) - 2023
- [c6]Jian Zhang, Da Zheng, Xiang Song, Theodore Vasiloudis, Israt Nisa, Jim Lu:
GraphStorm an Easy-to-use and Scalable Graph Neural Network Framework: From Beginners to Heroes. KDD 2023: 5790-5791 - [c5]Ricardo Silva Carvalho, Theodore Vasiloudis, Oluwaseyi Feyisetan, Ke Wang:
TEM: High Utility Metric Differential Privacy on Text. SDM 2023: 883-890 - 2021
- [i5]Ricardo Silva Carvalho, Theodore Vasiloudis, Oluwaseyi Feyisetan:
BRR: Preserving Privacy of Text Data Efficiently on Device. CoRR abs/2107.07923 (2021) - [i4]Ricardo Silva Carvalho, Theodore Vasiloudis, Oluwaseyi Feyisetan:
TEM: High Utility Metric Differential Privacy on Text. CoRR abs/2107.07928 (2021)
2010 – 2019
- 2019
- [b1]Theodore Vasiloudis:
Scalable Machine Learning through Approximation and Distributed Computing. Royal Institute of Technology, Stockholm, Sweden, 2019 - [j2]Theodore Vasiloudis, Gianmarco De Francisci Morales, Henrik Boström:
Quantifying Uncertainty in Online Regression Forests. J. Mach. Learn. Res. 20: 155:1-155:35 (2019) - [c4]Theodore Vasiloudis, Hyunsu Cho, Henrik Boström:
Block-distributed Gradient Boosted Trees. SIGIR 2019: 1025-1028 - [i3]Theodore Vasiloudis, Hyunsu Cho, Henrik Boström:
Block-distributed Gradient Boosted Trees. CoRR abs/1904.10522 (2019) - 2017
- [j1]Olof Görnerup, Daniel Gillblad, Theodore Vasiloudis:
Domain-agnostic discovery of similarities and concepts at scale. Knowl. Inf. Syst. 51(2): 531-560 (2017) - [c3]Theodore Vasiloudis, Foteini Beligianni, Gianmarco De Francisci Morales:
BoostVHT: Boosting Distributed Streaming Decision Trees. CIKM 2017: 899-908 - [c2]Theodore Vasiloudis, Hossein Vahabi, Ross Kravitz, Valery Rashkov:
Predicting Session Length in Media Streaming. SIGIR 2017: 977-980 - [i2]Theodore Vasiloudis, Hossein Vahabi, Ross Kravitz, Valery Rashkov:
Predicting Session Length in Media Streaming. CoRR abs/1708.00130 (2017) - 2016
- [i1]Olof Görnerup, Theodore Vasiloudis:
Mining Similarities and Concepts at Scale. ERCIM News 2016(107) (2016) - 2015
- [c1]Olof Görnerup, Daniel Gillblad, Theodore Vasiloudis:
Knowing an Object by the Company it Keeps: A Domain-Agnostic Scheme for Similarity Discovery. ICDM 2015: 121-130
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-13 01:37 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:
