ivoox

Radial Attention: $O(nlog n)$ Sparse Attention with Energy Decay for Long Video Generation

Recent advances in diffusion models have enabled high-quality video generation, but the additional temporal dimension significantly increases computational costs, making training and inference on long ...
GitHub

A nlog^2(n) algorithm to find the largest distance possible between individuals for p ...

Given a straight line of tables or spaces at which one person may sit/stand, what is the maximum distance at which people can be spaced apart? This very simple divide-and-conquer algorithm seeks to ...
x

Misuki on X: "@maspy_stars pQ 計算量のところ脱字してました ( O(Nlog^2) -&gt ...

競技プログラマー、日本語を少し話せます たまにアニメやゲームのツイートもします CF薄橙 AtC黄(algo) ICPC'23/26 World Finalist ...
IEEE

Shortest path-planning on polygonal surfaces with O (nlog n) time

Abstract: This paper proposes an O(nlog n) time algorithm capable of finding near-shortest path on polygonal surfaces. Shortest-path planning in 3-dimensional space is an NP-hard problem.
GitHub

N-body-Simulation-O-nlog-n-

This project implements a GPU-accelerated 2D N-body simulation using the Barnes-Hut algorithm and NVIDIA's CUDA framework. The Barnes-Hut algorithm reduces the computational complexity of particle ...