-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 "Danny Ayers" <danny666@virgilio.it> writes: > I've been working on this problem for a similar purpose, though haven't come > up with any magic. What looks most promising to me so far is to take > advantage of the topology of the graph (something you shouldn't have too > much trouble with after RDFAuthor ;-) The wrapping ('folding' is the term > I've been using) might start at any particular point in the graph, and > examine the neighbouring nodes. Thanks Danny, a) 'folding' is a nice word for it. I might steal that ;-) b) This 'folding' (cheers) algorithm is (I think) exactly what one group has been using here at HP. Very close, at least. Looks promising. Damian -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.0.6 (GNU/Linux) Comment: Processed by Mailcrypt 3.5.6 and Gnu Privacy Guard <http://www.gnupg.org/> iD8DBQE9Nrl4AyLCB+mTtykRAo+WAJ0Sa1YmVw19IZhPAh++hK/iIz/AcACdE1K5 iiDZfnx+Po7nmq2DSQ1/3C4= =dD9d -----END PGP SIGNATURE-----Received on Thursday, 18 July 2002 08:50:23 UTC
This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 22:44:37 UTC