—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
An important aspect in social computing is the structure of social networks, which build the underlying substrate for the exchange of information. With the growing importance of mi...
In EM and related algorithms, E-step computations distribute easily, because data items are independent given parameters. For very large data sets, however, even storing all of th...
This paper proposes a few steps to escape structured extensive representations for objects, in the context of evolutionary Topological Optimum Design (TOD) problems: early results ...