https://jaehun.me/tags/data-structures-and-algorithms/Recent content in Data Structures and Algorithms on Jaehun's BlogHugoko-krSat, 19 Sep 2026 01:44:51 +0900https://jaehun.me/posts/query-efficient-correlation-clustering-with-noisy-oracle/Tue, 12 Nov 2024 00:00:00 +0900https://jaehun.me/posts/query-efficient-correlation-clustering-with-noisy-oracle/<p>논문 : <a href="https://arxiv.org/abs/2402.01400"target="_blank" class="inline-flex items-center gap-1" >https://arxiv.org/abs/2402.01400<svg class="h-3 w-3 flex-shrink-0" id="external-link" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M15 3h6v6m-11 5L21 3m-3 10v6a2 2 0 0 1-2 2H5a2 2 0 0 1-2-2V8a2 2 0 0 1 2-2h6"/></svg> </a></p> <p>아래글은 Scholar GPT와 대화를 나눈 내용입니다.</p> <h2 id="핵심-내용과-강점-알고리즘-한계">핵심 내용과 강점, 알고리즘, 한계<a href="#%ed%95%b5%ec%8b%ac-%eb%82%b4%ec%9a%a9%ea%b3%bc-%ea%b0%95%ec%a0%90-%ec%95%8c%ea%b3%a0%eb%a6%ac%ec%a6%98-%ed%95%9c%ea%b3%84" class="heading-anchor" aria-label="이 섹션에 대한 링크"></a></h2> <blockquote class="border-primary bg-muted/30 hover:bg-muted/40 my-6 rounded-r-lg border-l-4 py-4 pr-4 pl-6 italic transition-all duration-200 ease-out hover:translate-x-1" > <div class="prose prose-sm max-w-none"> <p>물어본 것: 논문의 핵심 내용과 강점, 알고리즘 설명, 그리고 한계점</p>https://jaehun.me/posts/optimal-kernel-orchestration-for-tensor-programs-with-korch/Tue, 05 Nov 2024 00:00:00 +0900https://jaehun.me/posts/optimal-kernel-orchestration-for-tensor-programs-with-korch/<p>논문 : <a href="https://arxiv.org/abs/2406.09465"target="_blank" class="inline-flex items-center gap-1" >https://arxiv.org/abs/2406.09465<svg class="h-3 w-3 flex-shrink-0" id="external-link" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M15 3h6v6m-11 5L21 3m-3 10v6a2 2 0 0 1-2 2H5a2 2 0 0 1-2-2V8a2 2 0 0 1 2-2h6"/></svg> </a></p> <p>아래글은 Scholar GPT와 대화를 나눈 내용입니다.</p> <h2 id="핵심-내용과-강점-알고리즘-한계">핵심 내용과 강점, 알고리즘, 한계<a href="#%ed%95%b5%ec%8b%ac-%eb%82%b4%ec%9a%a9%ea%b3%bc-%ea%b0%95%ec%a0%90-%ec%95%8c%ea%b3%a0%eb%a6%ac%ec%a6%98-%ed%95%9c%ea%b3%84" class="heading-anchor" aria-label="이 섹션에 대한 링크"></a></h2> <blockquote class="border-primary bg-muted/30 hover:bg-muted/40 my-6 rounded-r-lg border-l-4 py-4 pr-4 pl-6 italic transition-all duration-200 ease-out hover:translate-x-1" > <div class="prose prose-sm max-w-none"> <p>물어본 것: 논문의 핵심 내용과 강점, 알고리즘 설명, 그리고 한계점</p>https://jaehun.me/posts/memory-bounds-for-the-experts-problem/Mon, 04 Nov 2024 00:00:00 +0900https://jaehun.me/posts/memory-bounds-for-the-experts-problem/<p>논문 : <a href="https://arxiv.org/abs/2204.09837"target="_blank" class="inline-flex items-center gap-1" >https://arxiv.org/abs/2204.09837<svg class="h-3 w-3 flex-shrink-0" id="external-link" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M15 3h6v6m-11 5L21 3m-3 10v6a2 2 0 0 1-2 2H5a2 2 0 0 1-2-2V8a2 2 0 0 1 2-2h6"/></svg> </a></p> <p>아래글은 Scholar GPT와 대화를 나눈 내용입니다.</p> <h2 id="핵심-내용과-강점-알고리즘-한계">핵심 내용과 강점, 알고리즘, 한계<a href="#%ed%95%b5%ec%8b%ac-%eb%82%b4%ec%9a%a9%ea%b3%bc-%ea%b0%95%ec%a0%90-%ec%95%8c%ea%b3%a0%eb%a6%ac%ec%a6%98-%ed%95%9c%ea%b3%84" class="heading-anchor" aria-label="이 섹션에 대한 링크"></a></h2> <blockquote class="border-primary bg-muted/30 hover:bg-muted/40 my-6 rounded-r-lg border-l-4 py-4 pr-4 pl-6 italic transition-all duration-200 ease-out hover:translate-x-1" > <div class="prose prose-sm max-w-none"> <p>물어본 것: 논문의 핵심 내용과 강점, 알고리즘 설명, 그리고 한계점</p>