256 search results - page 28 / 52 » Sparse random graphs with clustering |
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
CONNECTION
2006
13 years 7 months ago
2006
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We present a detailed study about the role of the short-cuts of a network in promoting the emergence of cooperation in a population of agents playing the Prisoner's Dilemma Ga...