1542 search results - page 153 / 309 » The metamathematics of random graphs |
128
click to vote
GLOBECOM
2010
IEEE
14 years 12 months ago
2010
IEEE
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
125
click to vote
CRYPTO
2007
Springer
15 years 8 months ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
121
click to vote
WINE
2009
Springer
15 years 8 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...
107
click to vote
ACMSE
2005
ACM
15 years 7 months 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...
121
click to vote
EVOW
2004
Springer
15 years 7 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 ...