4009 search results - page 255 / 802 » Clustering on Complex Graphs |
207
click to vote
ESA
2011
Springer
14 years 5 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
151
Voted
ATAL
2005
Springer
15 years 11 months ago
2005
Springer
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
165
click to vote
EUROPAR
2007
Springer
15 years 9 months ago
2007
Springer
To understand the principles of information processing in the brain, we depend on models with more than 105 neurons and 109 connections. These networks can be described as graphs o...
171
click to vote
ESWS
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. The original Semantic Web vision was explicit in the need for intelligent autonomous agents that would represent users and help them navigate the Semantic Web. We argue t...
180
click to vote
ICPADS
2007
IEEE
15 years 12 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...