Wyniki wyszukiwania:

Divide and Conquer is a well known algorithmic procedure for solving closest pair problems.In this procedure, the problem is partitioned into two parts until the problem is trivially solvable. It is theoretically and practically observed that sometimes partitioning the problem space into more than two parts can give better performances. In this work we proposed that dividing the problem space into (n) number of parts can give better result.We organized the book as follows,in Chapter 2, we discussed Divide-and-Conquer algorithm and Closest-Pair problem. In Chapter 3, we reviewed previous works...

The volume of documents in Internet are increasing every day . Again, each internet user has different search requirements. There are different approaches for creating user profiles by gathering user information through proxy servers or desktop robots . But both techniques require active participation of the user to install and configure these applications. In this work, we investigated the use of a less-expensive means of gathering user information for personalized or user specific search. Our study explored the effectiveness of personalized search based upon user profiles constructed from...