Zobrazeno 1 - 10
of 213
pro vyhledávání: '"Guha, Sudipto"'
Clustering is a fundamental tool for analyzing large data sets. A rich body of work has been devoted to designing data-stream algorithms for the relevant optimization problems such as $k$-center, $k$-median, and $k$-means. Such algorithms need to be
Externí odkaz:
http://arxiv.org/abs/1812.02023
Recent years have witnessed an increasing popularity of algorithm design for distributed data, largely due to the fact that massive datasets are often collected and stored in different locations. In the distributed setting communication typically dom
Externí odkaz:
http://arxiv.org/abs/1703.01539
Autor:
Ballen, Peter, Guha, Sudipto
Bootstrap percolation is an often used model to study the spread of diseases, rumors, and information on sparse random graphs. The percolation process demonstrates a critical value such that the graph is either almost completely affected or almost co
Externí odkaz:
http://arxiv.org/abs/1512.00834
Autor:
Ahn, Kook Jin, Guha, Sudipto
In this paper we consider graph algorithms in models of computation where the space usage (random accessible storage, in addition to the read only input) is sublinear in the number of edges $m$ and the access to input data is constrained. These quest
Externí odkaz:
http://arxiv.org/abs/1307.4359
Autor:
Ahn, Kook Jin, Guha, Sudipto
We present the first near optimal approximation schemes for the maximum weighted (uncapacitated or capacitated) $b$--matching problems for non-bipartite graphs that run in time (near) linear in the number of edges. For any $\delta>3/\sqrt{n}$ the alg
Externí odkaz:
http://arxiv.org/abs/1307.4355
Autor:
Guha, Sudipto, Munagala, Kamesh
In this paper, we consider several finite-horizon Bayesian multi-armed bandit problems with side constraints which are computationally intractable (NP-Hard) and for which no optimal (or near optimal) algorithms are known to exist with sub-exponential
Externí odkaz:
http://arxiv.org/abs/1306.3525
Publikováno v:
Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 11, pp. 1280-1291 (2012)
In today's Web and social network environments, query workloads include ad hoc and OLAP queries, as well as iterative algorithms that analyze data relationships (e.g., link analysis, clustering, learning). Modern DBMSs support ad hoc and OLAP queries
Externí odkaz:
http://arxiv.org/abs/1208.0089
Autor:
Ahn, Kook Jin, Guha, Sudipto
In this paper, we study the non-bipartite maximum matching problem in the semi-streaming model. The maximum matching problem in the semi-streaming model has received a significant amount of attention lately. While the problem has been somewhat well s
Externí odkaz:
http://arxiv.org/abs/1104.4058
Autor:
Ahn, Kook Jin, Guha, Sudipto
In this paper, we study linear programming based approaches to the maximum matching problem in the semi-streaming model. The semi-streaming model has gained attention as a model for processing massive graphs as the importance of such graphs has incre
Externí odkaz:
http://arxiv.org/abs/1104.2315
In this paper we initiate the study of optimization of bandit type problems in scenarios where the feedback of a play is not immediately known. This arises naturally in allocation problems which have been studied extensively in the literature, albeit
Externí odkaz:
http://arxiv.org/abs/1011.1161