2270 search results - page 229 / 454 » On the distribution of eigenvalues of graphs |
192
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...
178
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
169
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
190
click to vote
GLOBECOM
2007
IEEE
16 years 27 days ago
2007
IEEE
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
147
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...