We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
Iterative reconstruction algorithms augmented with regularization can produce high-quality reconstructions from few views and even in the presence of significant noise. In this pa...
—We introduce a new data set which contains both a self-declared friendship network and self-chosen attributes from a finite list defined by the social networking site. We prop...
Abstract— In this paper we describe an algorithm to compute cycle constraints that can be used in many graph-based SLAM algorithms; we exemplify it in Hierarchical SLAM. Our algo...
The Smart Surface1 project aims at designing an integrated micro-manipulator based on an array of micromodules connected with a 2D array topology network. Each micromodule comprise...