Re: Efficient Vector Comparison
- From: CBFalconer <cbfalconer@xxxxxxxxx>
- Date: Fri, 29 Jun 2007 13:01:20 -0400
Yao Qi wrote:
cri@xxxxxxxx (Richard Harter) writes:.... snip ...
There are a number of methods for managing and classifying set
of data elements (vectors in your case) such as hash tables and
patricia trees. They might be relevant or might not. There is
no way of knowing from your description.
We tried to use hash table, but we could not figure out how to
write a hash function in this case. I could have a try on
Patricia tree.
Try hashlib.zip, available at:
<http://cbfalconer.home.att.net/download/>
written in portable standard C, and released under GPL. The
package includes some hash functions, and references to literature
on hash functions. Simple is clearest.
--
<http://www.cs.auckland.ac.nz/~pgut001/pubs/vista_cost.txt>
<http://www.securityfocus.com/columnists/423>
<http://www.aaxnet.com/editor/edit043.html>
cbfalconer at maineline dot net
--
Posted via a free Usenet account from http://www.teranews.com
.
- References:
- Efficient Vector Comparison
- From: Yao Qi
- Re: Efficient Vector Comparison
- From: Richard Harter
- Re: Efficient Vector Comparison
- From: Yao Qi
- Efficient Vector Comparison
- Prev by Date: Re: Application programming language of choice
- Next by Date: Re: Efficient Vector Comparison
- Previous by thread: Re: Efficient Vector Comparison
- Next by thread: Re: Efficient Vector Comparison
- Index(es):
Relevant Pages
|
|