Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
In this paper we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a give...
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
Recent studies have shown that embedding similarity/dissimilarity measures between distributions in the variational level set framework can lead to effective object segmentation/t...