Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMárk Jelasity
- > Home > Persons > Márk Jelasity
Publications
- 2023
[c73]Gábor Danner
, István Hegedüs, Márk Jelasity:
Improving Gossip Learning via Limited Model Merging. ICCCI (CCIS Volume) 2023: 351-363- 2022
- [c71]Árpád Berta, Gábor Danner, István Hegedüs, Márk Jelasity:
Hiding Needles in a Haystack: Towards Constructing Neural Networks that Evade Verification. IH&MMSec 2022: 51-62 - 2021
- [j24]István Hegedüs, Gábor Danner, Márk Jelasity:
Decentralized learning works: An empirical comparison of gossip learning and federated learning. J. Parallel Distributed Comput. 148: 109-124 (2021) - [c69]István Megyeri, István Hegedüs, Márk Jelasity:
Robust Classification Combined with Robust out-of-Distribution Detection: An Empirical Analysis. IJCNN 2021: 1-8 - 2020
- [c68]István Megyeri, István Hegedüs, Márk Jelasity:
Attacking Model Sets with Adversarial Examples. ESANN 2020: 1-6 - [c67]István Megyeri, István Hegedüs, Márk Jelasity:
Adversarial Robustness of Model Sets. IJCNN 2020: 1-8 - [c66]Gábor Danner, István Hegedüs, Márk Jelasity:
Decentralized machine learning using compressed push-pull averaging. DICG@Middleware 2020: 31-36 - 2019
- [c64]István Hegedüs, Gábor Danner, Márk Jelasity:
Gossip Learning as a Decentralized Alternative to Federated Learning. DAIS 2019: 74-90 - [c62]István Megyeri, István Hegedüs, Márk Jelasity:
Adversarial robustness of linear models: regularization and dimensionality. ESANN 2019 - [c61]István Hegedüs, Gábor Danner, Márk Jelasity:
Decentralized Recommendation Based on Matrix Factorization: A Comparison of Gossip and Federated Learning. PKDD/ECML Workshops (1) 2019: 317-332 - 2018
- [j22]Gábor Danner, Árpád Berta, István Hegedüs, Márk Jelasity:
Robust Fully Distributed Minibatch Gradient Descent with Privacy Preservation. Secur. Commun. Networks 2018: 6728020:1-6728020:15 (2018) - 2017
- [j21]István Hegedüs, Márk Jelasity:
Differentially Private Linear Models for Gossip Learning through Data Perturbation. Open J. Internet Things 3(1): 62-74 (2017) - 2016
- [j20]István Hegedüs, Árpád Berta, Márk Jelasity:
Robust Decentralized Differentially Private Stochastic Gradient Descent. J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl. 7(2): 20-40 (2016) - [j19]István Hegedüs, Árpád Berta, Levente Kocsis, András A. Benczúr, Márk Jelasity:
Robust Decentralized Low-Rank Matrix Decomposition. ACM Trans. Intell. Syst. Technol. 7(4): 62:1-62:24 (2016) - [c57]Árpád Berta, István Hegedüs, Márk Jelasity:
Dimension Reduction Methods for Collaborative Mobile Gossip Learning. PDP 2016: 393-397 - [c56]István Hegedüs, Márk Jelasity:
Distributed Differentially Private Stochastic Gradient Descent: An Empirical Study. PDP 2016: 566-573 - 2014
- [c51]István Hegedüs, Márk Jelasity, Levente Kocsis, András A. Benczúr:
Fully distributed robust singular value decomposition. P2P 2014: 1-9 - 2013
- [j15]István Hegedüs, Róbert Ormándi, Márk Jelasity:
Massively Distributed Concept Drift Handling in Large Networks. Adv. Complex Syst. 16(4-5) (2013) - [j14]Róbert Ormándi, István Hegedüs, Márk Jelasity:
Gossip learning with linear models on fully distributed data. Concurr. Comput. Pract. Exp. 25(4): 556-571 (2013) - [c50]Balázs Szörényi, Róbert Busa-Fekete, István Hegedüs, Róbert Ormándi, Márk Jelasity, Balázs Kégl:
Gossip-based distributed stochastic bandit algorithms. ICML (3) 2013: 19-27 - 2012
- [c47]István Hegedüs, Róbert Busa-Fekete, Róbert Ormándi, Márk Jelasity, Balázs Kégl:
Peer-to-Peer Multi-class Boosting. Euro-Par 2012: 389-400 - [c46]István Hegedüs, Róbert Ormándi, Márk Jelasity:
Gossip-Based Learning under Drifting Concepts in Fully Distributed Networks. SASO 2012: 79-88 - 2011
- [c45]Róbert Ormándi, István Hegedüs, Márk Jelasity:
Asynchronous Peer-to-Peer Data Mining with Stochastic Gradient Descent. Euro-Par (1) 2011: 528-540 - [i2]Róbert Ormándi, István Hegedüs, Márk Jelasity:
Efficient P2P Ensemble Learning with Linear Models on Fully Distributed Data. CoRR abs/1109.1396 (2011) - 2010
- [c42]István Hegedüs, Róbert Ormándi, Richárd Farkas, Márk Jelasity:
Novel Balanced Feature Representation for Wikipedia Vandalism Detection Task - Lab Report for PAN at CLEF 2010. CLEF (Notebook Papers/LABs/Workshops) 2010 - [c41]Róbert Ormándi, István Hegedüs, Márk Jelasity:
Overlay Management for Fully Distributed User-Based Collaborative Filtering. Euro-Par (1) 2010: 446-457 - [c40]Róbert Ormándi, István Hegedüs, Kornel Csernai, Márk Jelasity:
Towards Inferring Ratings from User Behavior in BitTorrent Communities. WETICE 2010: 217-222
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 2023-09-27 22:51 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:
