Sciweavers

683 search results - page 41 / 137
» Graph Annotations in Modeling Complex Network Topologies
Sort
View
COMPLIFE
2005
Springer
15 years 3 months ago
The Architecture of a Proteomic Network in the Yeast
Abstract. We describe an approach to clustering the yeast protein-protein interaction network in order to identify functional modules, groups of proteins forming multi-protein comp...
Emad Ramadan, Christopher Osgood, Alex Pothen
WOWMOM
2009
ACM
143views Multimedia» more  WOWMOM 2009»
15 years 4 months ago
Improving partial cover of Random Walks in large-scale Wireless Sensor Networks
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
Leonidas Tzevelekas, Ioannis Stavrakakis
CORR
2008
Springer
115views Education» more  CORR 2008»
14 years 9 months ago
Positive circuits and maximal number of fixed points in discrete dynamical systems
We consider a product X of n finite intervals of integers, a map F from X to itself, the asynchronous state transition graph (F) on X that Thomas proposed as a model for the dynam...
Adrien Richard
COCOON
2007
Springer
15 years 3 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
CORR
2006
Springer
101views Education» more  CORR 2006»
14 years 9 months ago
Geographic Gossip: Efficient Aggregation for Sensor Networks
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....