838 search results - page 3 / 168 » On the Robustness of Complex Networks by Using the Algebraic... |
DAGSTUHL
2006
13 years 7 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
EH
2005
IEEE
13 years 11 months ago
2005
IEEE
In this paper we describe novel metrics measuring complexity in self-organising networks. The metrics are investigated within the context of decentralised inspections, developed a...
INFOCOM
2008
IEEE
13 years 12 months ago
2008
IEEE
—We study the problem of localizing a large sensor network having a complex shape, possibly with holes. A major challenge with respect to such networks is to figure out the corr...
DGCI
2005
Springer
13 years 11 months ago
2005
Springer
Due to the restriction of SIMD mode to local operations in VLSI massively parallel vision chips, using programmable connections and asynchronous communications are key ingredients ...
BMCBI
2005
13 years 5 months ago
2005
Background: Many complex random networks have been found to be scale-free. Existing literature on scale-free networks has rarely considered potential false positive and false nega...