Path: news.mathworks.com!not-for-mail
From: "Bruno Luong" <b.luong@fogale.fr>
Newsgroups: comp.soft-sys.matlab
Subject: Re: Finding similar entries
Date: Tue, 26 Feb 2008 20:33:02 +0000 (UTC)
Organization: FOGALE nanotech
Lines: 10
Message-ID: <fq1t1t$9ql$1@fred.mathworks.com>
References: <fq0ple$qos$1@fred.mathworks.com> <fq17qb$2b2$1@fred.mathworks.com> <fq1k3m$jl$1@fred.mathworks.com> <fq1o6c$1v5$1@fred.mathworks.com> <fq1s5q$oot$1@fred.mathworks.com>
Reply-To: "Bruno Luong" <b.luong@fogale.fr>
NNTP-Posting-Host: webapp-02-blr.mathworks.com
Content-Type: text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding: 8bit
X-Trace: fred.mathworks.com 1204057982 10069 172.30.248.37 (26 Feb 2008 20:33:02 GMT)
X-Complaints-To: news@mathworks.com
NNTP-Posting-Date: Tue, 26 Feb 2008 20:33:02 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 390839
Xref: news.mathworks.com comp.soft-sys.matlab:453861


"Yi Cao" <y.cao@cranfield.ac.uk> wrote in message
<fq1s5q$oot$1@fred.mathworks.com>...
> The main difficulty of the problem is that to fully store 
> distances of all pairs requires more than 2 Gb memory: 
> (25000*24999)/2*8=2.4999e9. 

No need to compute distance for all pairs, Delaunay
triangulation is the trick.

Bruno