Zobrazeno 1 - 10
of 155
pro vyhledávání: '"Yaron Singer"'
Autor:
Yaron Singer, Eric Balkanski
Publikováno v:
STOC
In this paper, we study submodular function minimization in the adaptive complexity model. Seminal work by Gr'otschel, Lovasz, and Schrijver shows that with oracle access to a function f, the problem of submodular minimization can be solved exactly w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::730e64845cc394d4d5620a4384366af3
https://doi.org/10.1145/3357713.3384287
https://doi.org/10.1145/3357713.3384287
Publikováno v:
Innovations in Computer Science (ICS)
We consider a dynamic auction model, where bidders sequentially arrive to the market. The values of the bidders for the item for sale are independently drawn from a distribution, but this distribution is unknown to the seller. The seller offers a per
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cebb644a6858960308fef73c0ad5e0be
https://doi.org/10.1145/3037382
https://doi.org/10.1145/3037382
Publikováno v:
STOC
In this paper we study submodular maximization under a matroid constraint in the adaptive complexity model. This model was recently introduced in the context of submodular optimization to quantify the information theoretic complexity of black-box opt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f38b471e3feb7edd23bb10373e6b818b
https://doi.org/10.1145/3313276.3316304
https://doi.org/10.1145/3313276.3316304
Autor:
Yaron Singer
Publikováno v:
ACM SIGecom Exchanges. 15:32-59
In this monograph we survey the adaptive seeding methodology for influence maximization. Influence maximization is the challenge of spreading information effectively through influential users in a social network. In many applications, one is restrict
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::65ddd2eafb552838b853b874cd3fda51
https://doi.org/10.1145/2994501.2994503
https://doi.org/10.1145/2994501.2994503
Autor:
GAGNE, YASMIN
Publikováno v:
Fast Company. Fall2024, Issue 264, p64-71. 8p. 16 Cartoon or Caricatures.
Autor:
Eric Balkanski, Yaron Singer
Publikováno v:
STOC
In this paper we study the adaptive complexity of submodular optimization. Informally, the adaptive complexity of a problem is the minimal number of sequential rounds required to achieve a constant factor approximation when polynomially-many queries
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96b7066136c0ca11412f44a299a7c520
https://doi.org/10.1145/3188745.3188752
https://doi.org/10.1145/3188745.3188752
Publikováno v:
IEEE/ACM Transactions on Networking. 23:282-299
Route instability is an important contributor to data plane unreliability on the Internet and also incurs load on the control plane of routers. In this paper, we study how route selection schemes can avoid these changes in routes. Modifying route sel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3ddcdaa53a2cbdfe11c9b1bce8266ad9
https://doi.org/10.1109/tnet.2014.2299795
https://doi.org/10.1109/tnet.2014.2299795
Autor:
Yaron Singer
Publikováno v:
ACM SIGecom Exchanges. 12:24-31
In this letter we sketch a brief introduction to budget feasible mechanism design. This framework captures scenarios where the goal is to buy items or services from strategic agents under budget. The setting introduces interesting challenges that ari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a05c7c4fb415ec734ef951d4f0a2f03a
https://doi.org/10.1145/2692359.2692366
https://doi.org/10.1145/2692359.2692366
Publikováno v:
KDD
We consider the task of evaluating the spread of influence in large networks in the well-studied independent cascade model. We describe a novel sampling approach that can be used to design scalable algorithms with provable performance guarantees. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9754f3ce1da6bf9acde8bfbc16a7a04
https://doi.org/10.1145/2783258.2783334
https://doi.org/10.1145/2783258.2783334