Abstract. We show that a simple probabilistic modelling of the registration problem for surfaces allows to solve it by using standard clustering techniques. In this framework, poin...
We consider problems on data sets where each data point has uncertainty described by an individual probability distribution. We develop several frameworks and algorithms for calcul...
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
The more information about current network conditions available to a transport protocol, the more efficiently it can use the network to transfer its data. In networks such as the...