We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to m uniformly chosen nodes in the complete g...
Remco van der Hofstad, Gerard Hooghiemstra, Piet V...
We present a class of algorithms for independent component analysis (ICA) which use contrast functions based on canonical correlations in a reproducing kernel Hilbert space. On th...
Sequential random sampling (`Markov Chain Monte-Carlo') is a popular strategy for many vision problems involving multimodal distributions over high-dimensional parameter spac...
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
In this paper we investigate the survivability of multilevel ad-hoc groups for critical operations through a case study. We aim to provide a formal trust framework for establishin...