Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
This paper aims at proposing a framework for animating virtual humans that can efficiently interact with real users in virtual reality (VR). If the user’s order can be modeled ...
Nicolas Pronost, Franck Multon, Qilei Li, Weidong ...