4 papers
Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs
Jie Gao, Pawel Gawrychowski, Panos Giannopoulos +4
A \emph{disk graph} is the intersection graph of (closed) disks in the plane. We consider the classic problem of finding a maximum clique in a disk graph. For general disk graphs,…
KELP: Robust Online Log Parsing Through Evolutionary Grouping Trees
Satyam Singh, Sai Niranjan Ramachandran
Real-time log analysis is the cornerstone of observability for modern infrastructure. However, existing online parsers are architecturally unsuited for the dynamism of production e…
Polar Separable Transform for Efficient Orthogonal Rotation-Invariant Image Representation
Satya P. Singh, Rashmi Chaudhry, Anand Srivastava +1
Orthogonal moment-based image representations are fundamental in computer vision, but classical methods suffer from high computational complexity and numerical instability at large…
Online Epsilon Net and Piercing Set for Geometric Concepts
Sujoy Bhore, Devdan Dey, Satyam Singh
VC-dimension and -nets are key concepts in Statistical Learning Theory. Intuitively, VC-dimension is a measure of the size of a class of sets. The famous …