Sciweavers

2680 search results - page 83 / 536
» The topology of the independence complex
Sort
View
90
Voted
WIOPT
2010
IEEE
14 years 11 months ago
K-shell decomposition for dynamic complex networks
—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 [...
Daniele Miorandi, Francesco De Pellegrini
DCG
2011
14 years 8 months ago
Random Geometric Complexes
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...
Matthew Kahle
CSE
2009
IEEE
15 years 4 months ago
Clustering Signature in Complex Social Networks
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...
Ueli Peter, Tomas Hruz
ICML
2008
IEEE
16 years 2 months ago
Fully distributed EM for very large datasets
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...
Jason Wolfe, Aria Haghighi, Dan Klein
APIN
2002
70views more  APIN 2002»
15 years 1 months ago
Compact Unstructured Representations for Evolutionary Design
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 ...
Hatem Hamda, François Jouve, Evelyne Lutton...