In this paper, we study a prototype learning problem, called Median Point-Set, whose objective is to construct a prototype for a set of given point-sets so as to minimize the total Earth Mover’s Distances (EMD) between the prototype and the point-sets, where EMD between two point-sets is measured under affine transformation. For this problem, we present the first purely geometric approach. Comp...

Point annotations are considerably more time-efficient than bounding box annotations. However, how to use cheap point boost the performance of semi-supervised object detection is still an open question. In this work, we present Point-Teaching, a weakly- and framework fully utilize Specifically, propose Hungarian-based point-matching method generate pseudo labels for point-annotated images. We f...

‎a total dominating set of a graph $g$ is a set $d$ of vertices of $g$ such that every vertex of $g$ has a neighbor in $d$‎. ‎the total domination number of a graph $g$‎, ‎denoted by $gamma_t(g)$‎, ‎is~the minimum cardinality of a total dominating set of $g$‎. ‎chellali and haynes [total and paired-domination numbers of a tree, akce international ournal of graphs and combinatorics 1 (2004)‎, ‎6...

In this paper, we use the concept of graph convergence of H(.,.)-co-accretive mapping introduced by [R. Ahmad, M. Akram, M. Dilshad, Graph convergence for the H(.,.)-co-accretive mapping with an application, Bull. Malays. Math. Sci. Soc., doi: 10.1007/s40840-014-0103-z, 2014$] and define an over-relaxed proximal point method to obtain the solution of a generalized variational inclusion problem ...

We study an optimal mass transport problem between two equal masses on a metric graph where the cost is given by the distance in the graph. To solve this problem we find a Kantorovich potential as the limit of p−Laplacian type problems in the graph where at the vertices we impose zero total flux boundary conditions. In addition, the approximation procedure allows us to find a transport density ...