Sciweavers

604 search results - page 22 / 121
» Identifying and evaluating community structure in complex ne...
Sort
View
SDM
2010
SIAM
182views Data Mining» more  SDM 2010»
14 years 11 months ago
HCDF: A Hybrid Community Discovery Framework
We introduce a novel Bayesian framework for hybrid community discovery in graphs. Our framework, HCDF (short for Hybrid Community Discovery Framework), can effectively incorporate...
Keith Henderson, Tina Eliassi-Rad, Spiros Papadimi...
ICECCS
2010
IEEE
158views Hardware» more  ICECCS 2010»
14 years 10 months ago
A Network Analysis of Stakeholders in Tool Visioning Process for Story Test Driven Development
Participation from all stakeholders is important in a successful software development project, especially if the development project is complex and has many stakeholders. Identify...
Shelly Park, Frank Maurer
IPL
2008
145views more  IPL 2008»
14 years 9 months ago
Complexity analysis of a decentralised graph colouring algorithm
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...
Ken R. Duffy, N. O'Connell, Artëm Sapozhnikov
WIOPT
2010
IEEE
14 years 8 months ago
K-shell decomposition for dynamic complex networks
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
Daniele Miorandi, Francesco De Pellegrini
OPODIS
2007
14 years 11 months ago
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
Olivier Beaumont, Anne-Marie Kermarrec, Etienne Ri...