Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Morteza Zadimoghaddam"'
Publikováno v:
FOCS
Online bipartite matching and its variants are among the most fundamental problems in the online algorithms literature. Karp, Vazirani, and Vazirani (STOC 1990) introduced an elegant algorithm for the unweighted problem that achieves an optimal compe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b32f98ed8219004e6670c3d669970749
https://doi.org/10.1109/focs46700.2020.00046
https://doi.org/10.1109/focs46700.2020.00046
Publikováno v:
ITA
FOCS
FOCS
We propose online algorithms for Column Subset Selection (CSS) and Principal Component Analysis (PCA), two methods that are widely employed for data analysis, summarization, and visualization. Given a data matrix A that is revealed one column at a ti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4e47596f5ee54bc9a9640cb49860f1b
https://doi.org/10.1109/ita50056.2020.9244974
https://doi.org/10.1109/ita50056.2020.9244974
Autor:
Sergei Vassilvitskii, Silvio Lattanzi, Alessandro Epasto, Michele Borassi, Morteza Zadimoghaddam
Publikováno v:
PODS
The streaming computation model is a standard model for large-scale data analysis: the input arrives one element at a time, and the goal is to maintain an approximately optimal solution using only a constant, or, at worst, polylogarithmic space.In pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8da95d0407112d3d4fc153db89ddffb1
https://doi.org/10.1145/3294052.3319701
https://doi.org/10.1145/3294052.3319701
Publikováno v:
SPAA
In this paper, we study the diversity maximization problem (a.k.a. maximum dispersion problem) in which given a set of n objects in a metric space, one wants to find a subset of k distinct objects with the maximum sum of pairwise distances. We addres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01bce14aa48d7880050540ed245f376a
https://doi.org/10.1145/3323165.3323172
https://doi.org/10.1145/3323165.3323172
Publikováno v:
ACM Transactions on Economics and Computation. 3:1-16
We study the design of revenue-maximizing mechanisms for selling nonexcludable public goods. In particular, we study revenue-maximizing mechanisms in Bayesian settings for facility location problems on graphs where no agent can be excluded from using
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a80df02617e9debdaa4b3753ba580a7e
https://doi.org/10.1145/2790131
https://doi.org/10.1145/2790131
Publikováno v:
SPAA
We study the problem of efficiently optimizing submodular functions under cardinality constraints in distributed setting. Recently, several distributed algorithms for this problem have been introduced which either achieve a sub-optimal solution or th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35e17d12e933bc771c66dc30386d4f1d
https://doi.org/10.1145/3087556.3087574
https://doi.org/10.1145/3087556.3087574
Publikováno v:
WWW
Maximizing submodular functions under cardinality constraints lies at the core of numerous data mining and machine learning applications, including data diversification, data summarization, and coverage problems. In this work, we study this question
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::18463651f1c28b2629dc21453e911eb9
https://doi.org/10.1145/3038912.3052699
https://doi.org/10.1145/3038912.3052699
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 31
Feature selection is a fundamental problem in machine learning and data mining. The majority of feature selection algorithms are designed for running on a single machine (centralized setting) and they are less applicable to very large datasets. Altho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e1464752e0d08e4cf442f627bc4292f
https://doi.org/10.1609/aaai.v31i1.10926
https://doi.org/10.1609/aaai.v31i1.10926