Search Results for author:
Found 2 papers, 0 papers with code
A Few-Shot Sequential Approach for Object Counting
In this work, we address the problem of few-shot multi-class object counting with point-level annotations.
Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph
We show that $\mathcal{F}_{FPS}$ can be bounded in terms of the minimal value $\mathcal{F}^*$ of the stretch factor obtained using an optimal placement of $k$ sources as $\mathcal{F}_{FPS}\leq 2 r_e^2 \mathcal{F}^*+ 2 r_e^2 + 8 r_e + 1$, where $r_e$ is the ratio of the lengths of the longest and the shortest edges of the graph.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
