3068 search results - page 92 / 614 » Clustering with Multiple Graphs |
133
click to vote
BIBE
2005
IEEE
15 years 6 months ago
2005
IEEE
In this article we present novel preprocessing techniques, based on topological measures of the network, to identify clusters of proteins from Protein-protein interaction (PPI) ne...
147
Voted
BIBE
2009
IEEE
15 years 7 months ago
2009
IEEE
—In order to simulate biological processes, we use multi-agents system. However, modelling cell behavior in systems biology is complex and may be based on intracellular biochemic...
105
Voted
FGR
2004
IEEE
15 years 4 months ago
2004
IEEE
We present an algorithm for automatic inference of human upper body motion. A graph model is proposed for inferring human motion, and motion inference is posed as a mapping proble...
ALGORITHMICA
2008
15 years 22 days ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
134
click to vote
TKDE
2012
13 years 3 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...