You are given a snapshot of the social graph G = (N, E, t) at time t. Each node has a set of attributes (a1, a2, ... an). Three problems:
1. Create an edge if two nodes have exactly the same set of attributes
2. Create an edge if two nodes have similar attributes
3. What if a set of weights it's known a-priori for the attributes?
Best paper awards at ICALP 2012
-
The preliminary version of the detailed programme for ICALP 2012 is now
available here. While skimming through the programme, I learnt that the
best paper ...
37 minutes ago
0 commenti:
Post a Comment