Blogs
Codeforces Round 995 Problem G
problem link: Codeforces Round 995 Problem G First, note that the problem constraints are as follows: The first line contains two integers nnn and qqq (1≤n≤201≤ n ≤201≤n≤20; 1≤q≤2⋅1051 ≤ q ≤ 2 \cdot 10^51≤q≤2⋅105) — the number of snakes and the number of events. This means we can use algorithms with high complexity with respect to nnn, since nnn is only 20.
January 2, 2025
Transformer
Introduction to the Transformer Model Welcome to the second post in our NLP series! If you haven’t read the previous post yet, you can find it here. In this post, we will delve into the fascinating world of the Transformer model. The original paper on the Transformer model can be found here. It was published by Vaswani et al. in 2017 and is titled “Attention Is All You Need”. This paper introduced the Transformer architecture and its attention mechanism, which has since become a cornerstone in the field of natural language processing.
September 2, 2024
Natural Language Processing
In this series of posts related to NLP, we will begin by discussing several foundational concepts and basic methodologies used to address the problem. Subsequently, we will cover the latest methods, such as GPTs. I presume the audience is familiar with the fundamental concepts of neural networks and multi-layer perceptrons (MLP). Word Embedding Computer-based methods operate on numerical data. Therefore, it is necessary to find a way to transform words in alphabetic languages or characters in character-based languages into numbers.
August 31, 2024
Binary indexed tree
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 Algorithm Average Worst case Space O(n)O(n) Search O(logn)O(logn) Insert O(logn)O(logn) Delete O(logn)O(logn) \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{O}(\log n) \\ \text { Insert } & \mathrm{O}(\log n) & \mathrm{O}(\log n) \\ \text { Delete } & \mathrm{O}(\log n) & \mathrm{O}(\log n) \end{array} Algorithm Space Search Insert Delete Average O(n)O(logn)O(logn)O(logn) Worst case O(n)O(logn)O(logn)O(logn)Explanation
October 4, 2023
Image to image translation
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 this limitation, we propose a Multimodal Unsupervised Image-to-image Translation (MUNIT) framework. (Abstract) Method
September 21, 2023
Segment Tree
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: O(n)O(n)O(n) Time Complexity:
September 17, 2023
Readme
The new post will be published both on this website and old blog. Previous posts can be found at blog. The blog at blog.ggeta.com is hosted on a personal server and is built with Go. It offers better support for mathematical expressions, although some features are still missing. Both blog systems will be synchronized. If you find that the mathematical expressions on this website are not satisfactory, you can visit blog.ggeta.com for a better experience.
May 19, 2023