Sciweavers

818 search results - page 26 / 164
» Network bargaining: algorithms and structural results
Sort
View
EPIA
2009
Springer
14 years 2 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...
ICASSP
2011
IEEE
12 years 11 months ago
Adaptive modelling with tunable RBF network using multi-innovation RLS algorithm assisted by swarm intelligence
— In this paper, we propose a new on-line learning algorithm for the non-linear system identification: the swarm intelligence aided multi-innovation recursive least squares (SIM...
Hao Chen, Yu Gong, Xia Hong
ICDM
2003
IEEE
107views Data Mining» more  ICDM 2003»
14 years 1 months ago
Objective and Subjective Algorithms for Grouping Association Rules
We propose two algorithms for grouping and summarizing association rules. The first algorithm recursively groups rules according to the structure of the rules and generates a tre...
Aijun An, Shakil M. Khan, Xiangji Huang
BMCBI
2010
150views more  BMCBI 2010»
13 years 8 months ago
MCL-CAw: a refinement of MCL for detecting yeast complexes from weighted PPI networks by incorporating core-attachment structure
Background: The reconstruction of protein complexes from the physical interactome of organisms serves as a building block towards understanding the higher level organization of th...
Sriganesh Srihari, Kang Ning, Hon Wai Leong
ATAL
2009
Springer
14 years 2 months ago
Distributed constraint optimization with structured resource constraints
Distributed constraint optimization (DCOP) provides a framework for coordinated decision making by a team of agents. Often, during the decision making, capacity constraints on age...
Akshat Kumar, Boi Faltings, Adrian Petcu