4009 search results - page 327 / 802 » Clustering on Complex Graphs |
161
click to vote
SWAT
2004
Springer
16 years 2 days ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
143
click to vote
RECOMB
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
173
click to vote
CIDM
2007
IEEE
16 years 1 months ago
2007
IEEE
−Document clustering has become an increasingly important task in analyzing huge numbers of documents distributed among various sites. The challenging aspect is to analyze this e...
177
click to vote
ICCCN
2007
IEEE
16 years 1 months ago
2007
IEEE
—Motivated by the fact that most of the existing QoS service composition solutions have limited scalability, we develop a hierarchical-based solution framework to achieve scalabi...
182
click to vote
ICDCSW
2005
IEEE
16 years 10 days ago
2005
IEEE
Recent researches have highlighted the importance of developing a network with distributed problem solving abilities thus enhancing reliability with equal share of network resourc...