A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
The paper classifies palettes of Dehn colorings for spatial graphs.
The paper finds minimum Dehn colors for knots and defines useful graphs for coloring.
Learning color mixing is difficult for novice painters. In order to support novice painters in learning color mixing, we propose a prediction model for semitransparent pigment mixtures and use its prediction results to create a Smart Palette system. Such a system is constructed by first building a watercolor dataset wi…
Grogan et al [11,12] have recently proposed a solution to colour transfer by minimising the Euclidean distance L2 between two probability density functions capturing the colour distributions of two images (palette and target). It was shown to be very competitive to alternative solutions based on Optimal Transport for c…
Meta Optimal Transport learns from past problems to solve similar OT problems faster.
We extend Lipshitz-Sarkar's definition of a stable homotopy type associated to a link L whose cohomology recovers the Khovanov cohomology of L. Given an assignment c (called a coloring) of positive integer to each component of a link L, we define a stable homotopy type X_col(L_c) whose cohomology recovers the c-colored…
Optimal transport (OT) distances between probability distributions are parameterized by the ground metric they use between observations. Their relevance for real-life applications strongly hinges on whether that ground metric parameter is suitably chosen. Selecting it adaptively and algorithmically from prior knowledge…
Two heuristics solve dynamic multiple travelling salesmen problems.