Sciweavers

440 search results - page 11 / 88
» Robustness and modular structure in networks
Sort
View
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
15 years 2 months ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...
IPSN
2005
Springer
15 years 3 months ago
A compact modular wireless sensor platform
— We have designed and constructed a modular platform for use in compact wireless sensing. This platform is based around a series of circuit boards (or panes), each of which inst...
Ari Y. Benbasat, Joseph A. Paradiso
NDSS
2009
IEEE
15 years 4 months ago
Document Structure Integrity: A Robust Basis for Cross-site Scripting Defense
Cross-site scripting (or XSS) has been the most dominant class of web vulnerabilities in 2007. The main underlying reason for XSS vulnerabilities is that web markup and client-sid...
Yacin Nadji, Prateek Saxena, Dawn Song
WWW
2008
ACM
15 years 10 months ago
A framework for fast community extraction of large-scale networks
Most of the faster community extraction algorithms are based on the Clauset, Newman and Moore (CNM), which is employed for networks with sizes up to 500,000 nodes. The modificatio...
Yutaka I. Leon-Suematsu, Kikuo Yuta
CORR
2006
Springer
90views Education» more  CORR 2006»
14 years 9 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil