Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Vu, Hoa T."'
In this work, we provide data stream algorithms that compute optimal splits in decision tree learning. In particular, given a data stream of observations $x_i$ and their labels $y_i$, the goal is to find the optimal split $j$ that divides the data in
Externí odkaz:
http://arxiv.org/abs/2403.19867
We revisit the problem of finding small $\epsilon$-separation keys introduced by Motwani and Xu (2008). In this problem, the input is $m$-dimensional tuples $x_1,x_2,\ldots,x_n $. The goal is to find a small subset of coordinates that separates at le
Externí odkaz:
http://arxiv.org/abs/2211.13882
Autor:
Vu, Hoa T.
We revisit the MaxSAT problem in the data stream model. In this problem, the stream consists of $m$ clauses that are disjunctions of literals drawn from $n$ Boolean variables. The objective is to find an assignment to the variables that maximizes the
Externí odkaz:
http://arxiv.org/abs/2208.09160
Autor:
Vu, Hoa T., Pham, Giang T.T., Doan, Tan Le Hoang, Lam, Tran Dai, Van, Ngo Thuy, Van Manh, Nguyen, Quyen, Pham Thi, Hai, Nguyen Duc, Doan, Huan V., Nguyen, Manh B.
Publikováno v:
In Journal of the Taiwan Institute of Chemical Engineers August 2024 161
We present algorithms for the Max-Cover and Max-Unique-Cover problems in the data stream model. The input to both problems are $m$ subsets of a universe of size $n$ and a value $k\in [m]$. In Max-Cover, the problem is to find a collection of at most
Externí odkaz:
http://arxiv.org/abs/2102.08476
Publikováno v:
SIAM Journal on Discrete Mathematics 37(2), pp. 800-830 (2023)
Given a graph $G=(V,E)$ with arboricity $\alpha$, we study the problem of decomposing the edges of $G$ into $(1+\epsilon)\alpha$ disjoint forests in the distributed LOCAL model. Barenboim and Elkin [PODC `08] gave a LOCAL algorithm that computes a $(
Externí odkaz:
http://arxiv.org/abs/2009.10761
Autor:
Su, Hsin-Hao, Vu, Hoa T.
We study distributed algorithms for some fundamental problems in data summarization. Given a communication graph $G$ of $n$ nodes each of which may hold a value initially, we focus on computing $\sum_{i=1}^N g(f_i)$, where $f_i$ is the number of occu
Externí odkaz:
http://arxiv.org/abs/1908.00236
Autor:
Su, Hsin-Hao, Vu, Hoa T.
The densest subgraph problem, introduced in the 80s by Picard and Queyranne as well as Goldberg, is a classic problem in combinatorial optimization with a wide range of applications. The lowest outdegree orientation problem is known to be its dual pr
Externí odkaz:
http://arxiv.org/abs/1907.12443
Autor:
Su, Hsin-Hao, Vu, Hoa T.
Vizing showed that it suffices to color the edges of a simple graph using $\Delta + 1$ colors, where $\Delta$ is the maximum degree of the graph. However, up to this date, no efficient distributed edge-coloring algorithms are known for obtaining such
Externí odkaz:
http://arxiv.org/abs/1901.00479