Dirk wrote:
> Hi Gene,
>
> thanks for the reply!
> The majority of operations performed on this matrix will be searching
> for documents that contain a specific term.
>
> Regards,
> Dirk
A natural implementation would be a table of pairs.
Index the table on term so you can look up docnames quic
Rahul K wrote:
> Can somebody tell the fastest and the most optimized way to merge two
> unsorted singly linked list to get a sorted linked list.
It depends on how you define "most optimized." Mergesort is a
natural candidate for sorting singly linked lists.
X-Google-Language: ENGLISH,ASCII-7-b
Try b-trees. they are quite useful representations of large databases On 5/22/06, Dirk <[EMAIL PROTECTED]
> wrote:Hi Varun,thanks for your reply!Sparse matrix memory implementation sounds like a fit to me.
Will give Google a try and find out more about it!Thanks,DirkX-Google-Language: ENGLISH,ASC
Can somebody tell the fastest and the most optimized way to merge two
unsorted singly linked list to get a sorted linked list.
X-Google-Language: ENGLISH,ASCII-7-bit
Received: by 10.11.88.14 with SMTP id l14mr40973cwb;
Mon, 22 May 2006 07:04:25 -0700 (PDT)
X-Google-Token: UHX8kgwAAADkFNoU
Hello all,
I need to find the correlation between two binary matrixes - should i
use ceoss correlation for that or i can preform a simple convulution
task to achive it?
I googled 'cross correlation' so many times & find only the
mathematical concepts but not the real algorithm which i can implem
Hi Varun,
thanks for your reply!
Sparse matrix memory implementation sounds like a fit to me.
Will give Google a try and find out more about it!
Thanks,
Dirk
X-Google-Language: ENGLISH,ASCII-7-bit
Received: by 10.11.88.14 with SMTP id l14mr39040cwb;
Mon, 22 May 2006 02:40:52 -0700 (PDT
Hi Gene,
thanks for the reply!
The majority of operations performed on this matrix will be searching
for documents that contain a specific term.
Regards,
Dirk
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algor
