emperor: (lego scholar)
Add MemoryShare This Entry

Bah

posted by [personal profile] emperor at 07:16pm on 18/01/2005
I read a paper today that talked about a different definition of clustering coefficient, and noted that it was hard to compute. On the way home I thought about it a bit, and thought "I bet you could derive a neat algorithm based on ...". If you're interested in what I thought, you can find the algorithm here in a paper published on the 23rd September 2004.

This keeps happening to me - I should have been born about 3 years earlier, and I'd have a string of publications. Humbug.
Mood:: 'grumpy' grumpy
There are 2 comments on this entry. (Reply.)
 
posted by [identity profile] meirion.livejournal.com at 04:17pm on 18/01/2005
you are not the only one ...

-m-
 
posted by [identity profile] angoel.livejournal.com at 12:20am on 19/01/2005
Nah - even if you'd been born 3 years earlier, it would have been published 20 years previously in an obscure Russian journal.

October

SunMonTueWedThuFriSat
      1
 
2
 
3
 
4
 
5
 
6
 
7
 
8
 
9
 
10
 
11
 
12
 
13
 
14
 
15
 
16
 
17
 
18
 
19
 
20
 
21
 
22
 
23
 
24
 
25
26
 
27
 
28
 
29
 
30
 
31