Daniel Pryde ababo_2002 at hotmail.com
Mon Dec 29 09:28:08 EST 2003

• Previous message (by thread): Best match searching
• Next message (by thread): Best match searching
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

---

Thanks for the advice guys. I'll give it a try. One other thing I should 
mention is that, once a best match is found, the winner and its neighbours 
are changed slightly, and the euclidean distances have to be calculated 
again, so I'm not sure if a tree structure would be suitable for it. It's 
really a self organising map I'm trying to implement overall.

Daniel

_________________________________________________________________
Sign-up for a FREE BT Broadband connection today! 
http://www.msn.co.uk/specials/btbroadband

---

• Previous message (by thread): Best match searching
• Next message (by thread): Best match searching
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

---

More information about the Python-list mailing list