https://chen-gz.github.io//GGEtaWelcome to my blog. 2024-07-21T01:01:27+00:00 Guangzong Chen https://chen-gz.github.io// Jekyll © 2024 Guangzong Chen /assets/img/favicons/favicon.ico /assets/img/favicons/favicon-96x96.png Linux font2024-07-20T00:00:00+00:00 2024-07-20T00:00:00+00:00 https://chen-gz.github.io//posts/linux-font/ Guangzong Chen Here is the rewritten text in markdown format: Linux Fonts: Solving Display Issues After installing Arch Linux, you may encounter issues with font rendering while using a web browser. Unfortunately, online search results from ChatGPT and Google might not provide an immediate solution. Fortunately, installing the following fonts can generally resolve this problem: ttf-font-awesome: Provid... Codeforce Round 9262024-02-20T00:00:00+00:00 2024-05-18T04:31:31+00:00 https://chen-gz.github.io//posts/codeforces-round-926/ Guangzong Chen Porblem D Sasha and a Walk in the City The statement of this problem is not clear. Problem statement from the comment in tutorial page. Given a tree, you need to color each node in black or white. How many colorings exist such that the path between any two vertices contains atmost 2 black vertices. Define the state of dynamic programming as the tutorial. Let $dp_v$ be the number of no... Binary indexed tree2023-10-04T00:00:00+00:00 2023-10-04T00:00:00+00:00 https://chen-gz.github.io//posts/binary-indexed-tree/ Guangzong Chen Background A Fenwick tree or binary indexed tree is a data structure that can efficiently update elements and calculate prefix sums in a table of numbers.[^1] Space and Time Complexity \[\begin{array}{lll} \text { Algorithm } & \text { Average } & \text { Worst case } \\ \text { Space } & \mathrm{O}(n) & \mathrm{O}(n) \\ \text { Search } & \mathrm{O}(\log n) & \mathrm... Image to image translation2023-09-21T00:00:00+00:00 2024-03-01T18:01:12+00:00 https://chen-gz.github.io//posts/img2img/ Guangzong Chen https://arxiv.org/abs/1512.04150 https://arxiv.org/abs/2104.01538 Multimodal Unsupervised Image-to-Image Translation Purpose While this conditional distribution is inherently multimodal, existing approaches make an overly simplified assumption, modeling it as a deterministic one-to-one mapping. As a result, they fail to generate diverse outputs from a given source domain image. To address... Segment Tree2023-09-17T00:00:00+00:00 2024-01-31T18:37:46+00:00 https://chen-gz.github.io//posts/segment-tree/ Guangzong Chen In computer science, a segment tree, also known as a statistic tree, is a tree data structure used for storing information about intervals, or segments. It allows querying which of the stored segments contain a given point. It is, in principle, a static structure; that is, it’s a structure that cannot be modified once it’s built. A similar data structure is the interval tree. Space Complexity:...