A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opat...
The paper addresses the convergence of a decentralized Robbins-Monro algorithm for networks of agents. This algorithm combines local stochastic approximation steps for finding th...
In this paper, we propose novel algorithms for total variation (TV) based image restoration and parameter estimation utilizing variational distribution approximations. Within the h...
S. Derin Babacan, Rafael Molina, Aggelos K. Katsag...
This paper describes a new method for determining correspondence between points on pairs of surfaces based on shape using a combination of geodesic distance and surface curvature....
Yongmei Wang, Bradley S. Peterson, Lawrence H. Sta...
A directional spatial relationship to a reference object (e.g., "east of the post office") can be represented by a spatial template. The template partitions the space in...