Zobrazeno 1 - 10
of 101
pro vyhledávání: '"Do, Thao P."'
Autor:
Do, Thao
Extracting fine-grained OCR text from aged documents in diacritic languages remains challenging due to unexpected artifacts, time-induced degradation, and lack of datasets. While standalone spell correction approaches have been proposed, they show li
Externí odkaz:
http://arxiv.org/abs/2410.13305
Autor:
Mai Ngo Tra, Thi Tham Trinh, Thuy Hang Nguyen Thi, Thi Hong Khuat, Lien Nghiem Thi Ha, Nghia Nguyen Trong, Hang Phan Thi Thanh, Toan Vu Duc, Tap Van Huu, Van Thang Duong, Ly Do Thao
Publikováno v:
Green Processing and Synthesis, Vol 13, Iss 1, Pp 58514-36 (2024)
Incineration plants for electricity generation have offered a solution to the challenges of domestic solid waste treatment in many countries. However, their emissions, fly ash (FA) and bottom ash (BA), have had a detrimental impact on environmental q
Externí odkaz:
https://doaj.org/article/59cd46136b1a4b74b4c221cbe301c598
Autor:
Do, Thao, Kim, Daeyoung
There are many real-life use cases such as barcode scanning or billboard reading where people need to detect objects and read the object contents. Commonly existing methods are first trying to localize object regions, then determine layout and lastly
Externí odkaz:
http://arxiv.org/abs/2102.07354
Barcodes are ubiquitous and have been used in most of critical daily activities for decades. However, most of traditional decoders require well-founded barcode under a relatively standard condition. While wilder conditioned barcodes such as underexpo
Externí odkaz:
http://arxiv.org/abs/2004.06297
Interpreting the behaviors of Deep Neural Networks (usually considered as a black box) is critical especially when they are now being widely adopted over diverse aspects of human life. Taking the advancements from Explainable Artificial Intelligent,
Externí odkaz:
http://arxiv.org/abs/2001.01578
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Do, Thao T.
Given $m$ points and $n$ hyperplanes in $\mathbb{R}^d$, if there are many incidences, we expect to find a big cluster $K_{r,s}$ in their incidence graph. Apfelbaum and Sharir found lower and upper bounds for the largest size of $rs$, which only match
Externí odkaz:
http://arxiv.org/abs/1810.01551
Autor:
Do, Thao T.
Non-degeneracy was first defined for hyperplanes by Elekes-T\'oth, and later extended to spheres by Apfelbaum-Sharir: given a set $P$ of $m$ points in $\mathbb{R}^d$ and some $\beta\in(0,1)$, a $(d-1)$-dimensional sphere (or a $(d-1)$-sphere) $S$ in
Externí odkaz:
http://arxiv.org/abs/1810.01043
Autor:
Do, Thao, Sheffer, Adam
We derive a general upper bound for the number of incidences with $k$-dimensional varieties in ${\mathbb R}^d$. The leading term of this new bound generalizes previous bounds for the special cases of $k=1, k=d-1,$ and $k= d/2$, to every $1\le k
Externí odkaz:
http://arxiv.org/abs/1806.04230
Given a fixed positive integer $k$, the $k$-planar local crossing number of a graph $G$, denoted by $\text{LCR}_k(G)$, is the minimum positive integer $L$ such that $G$ can be decomposed into $k$ subgraphs, each of which can be drawn in a plane such
Externí odkaz:
http://arxiv.org/abs/1804.02117