We study flows over time in networks with transit times on the arcs. Transit times describe how long it takes to traverse an arc. A flow over time specifies for each arc a time-dep...
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
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...
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
: This paper presents an adaptation of Lowe's numerical model-based camera localisation algorithm to the domain of indoor mobile robotics. While the original method is straigh...