Often, independent organizations define and advocate different XML formats for a similar purpose and, as a result, application programs need to mutually convert between such forma...
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...
Images taken with wide-angle cameras tend to have severe distortions which pull points towards the optical center: This paper proposes a method for recovering the disrortion param...
Visual understanding is often based on measuring similarity between observations. Learning similarities specific to a certain perception task from a set of examples has been show...
Michael Bronstein, Alexander Bronstein, Nikos Para...