[Note] Triangle Counting over Large-scale Directed Graphs
Exact and scalable triangle counting on large-scale directed graphs, where triangles have seven different types determined by edge directions and the graph may be too large for a s
Research, working notes, and small observations.
A collection in progress, arranged from newest to oldest.
Exact and scalable triangle counting on large-scale directed graphs, where triangles have seven different types determined by edge directions and the graph may be too large for a s
CoT (Chain-of-Thought) brings memory bottleneck (KV Cache), limits the practical deployment of LRMs (Large Reasoning Models) under constrained GPU resources.
When you see a string like RG8gdSBrbm93IEJBU0U2ND8=, random letters and numbers with = at the end, you should guess it might be a Base64 string. How does it work? How to write you
We know that Discord has a sound board, which allows you to play various weird sounds in game. But sadly it doesn't work in full screen game like ELDEN RING:NIGHTREGIN.
Delete Git/Github Commit
performance (i.e., task success and accuracy)
We have a slow, big target model M_p, inference from which we're trying to accelerate (distribution p(x)). We also have a quick, efficient approximation model M_q (distribution q(x
FreeKV, a training-free algorithm-system co-optimization framework that boosts the efficiency of KV retrieval, while maintaining near-lossless model accuracy across diverse scenari
问各路 ai 半天也没怎么特别搞清楚,最后总算找到一个讲的不错的 🤪。
hsvvrp.zjsvzlsfo.paola.lluayhujlp..pzy.bolyl.
看到这个粒子效果,我第一反应是真实的物理模拟,然后我嗯写俩小时加速度写了个抽象玩意出来😎,思路错的很。还好洗澡的时候想明白了()
使用 Rust 作服务端,基于 WebSocket 的类 IRC 网络聊天室
最后还需自行实现 optimize4 来尽可能的去优化,但是不能开 O2 、改算法等。
使用Windows API CreateRemoteThread 远程注入模块到 crackme 进程中并且不崩溃,然后使用 ark 工具(例如 processhacker 等)能够查看注入模块的信息;
四个阿拉伯数字表示一个数字,由此出发,我发现我刚才那一串 01 写反了,要倒着看:
单纯想学习/尝试一下 misc,就来这玩了,反正招新不带大三老屁股 😥
NAT(Network Address Translation,网络地址转换),是一种在IP数据包通过路由器或防火墙时重写IP地址或目的IP地址的技术。这种技术使得多台主机可以通过一个共有IP地址访问互联网的私有网络中,解决了IPv4地址短缺的问题[2]。
VMware 安卓 Ubuntu,固定 IP,SSH 远程登录
F is the family of sets over a universe U, k is a positive integer. The task is to check whether there exists a subfamily F' \subseteq F of size k that covers U, which means that e
前面的都好办,和C++啥的都大差不差,后面的给我看的云里雾里,要用的话再看吧
BV1aZ4y1f7e2是很好的教程,我自己摸索很久最后还是看了这个教程,简单有效
题意:有n个罐子,每个罐子有坚固度a_i,同时有m个钥匙,每个钥匙型号为b_i,可以打开坚固度恰好为b_i的罐子。我们可以不断攻击罐子,每次攻击让罐子的坚固度x变为x/d(向下取整)。Q次询问,每次询问L到R区间,在满足用钥匙开罐子最多的情况下,使用钥匙的最少数。
题意: 有A,B两个字符串,求f(a,b)_{max} = x*LCS(a,b)-y*|a|-z*|b|,其中x,y,z是题目里给的常数,a,b是A,B在子串。
题意:给定一个无向连通图,求至少要去掉几条边才能使图不连通,即求无向连通图的最小割
题意:给定n个点,顺次连接这些点得到折线。m次询问,每次给出一个点,询问折线绕该点的回转数
题意:对两个无序且长度任意的序列a和b进行归并,同时要求结果的字典序最小