2079 search results - page 179 / 416 » Universality of random graphs |
196
click to vote
TSP
2011
15 years 1 months ago
2011
—This paper proposes a technique for motion estimation of groups of targets based on evolving graph networks. The main novelty over alternative group tracking techniques stems fr...
179
click to vote
WINE
2009
Springer
16 years 1 months ago
2009
Springer
We argue that users in social networks are strategic in how they post and propagate information. We propose two models — greedy and courteous — and study information propagatio...
173
click to vote
ACMSE
2005
ACM
16 years 3 days ago
2005
ACM
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
180
click to vote
EVOW
2004
Springer
15 years 12 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
157
click to vote
TSP
2008
15 years 6 months ago
2008
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...