Boost logo

Boost :

Subject: Re: [boost] GSoC 2011
From: mahbubul hasan (shanto86_at_[hidden])
Date: 2011-04-21 02:02:10

Here is some update regarding the proposal:

Extended Proposal:

There will be a unit test to check the correctness of the implementation.
The reference for the unit test module can be:
"/boost_1_46_1/libs/range/test/algorithm_test". We will test our algorithm
varying error rate and check if we are getting the output as we expect. We
need to monitor the following facts:

1. error rate
2. individual minimum, maximum and average time of each operation (push,
extract, delete)

The applications that can be implemented as a part of project is listed
below in the order of priority:

1. Median in Linear time.
2. Selection algorithm (Reference: Wikipedia)
3. Dynamic Maintainance of grades (reference: chazzele's paper). We can make
a documentation explaining how it can be done using soft heap.
4. Minimum spanning tree, and check the performance between soft heap
version MST and general MST


On Fri, Apr 8, 2011 at 3:19 AM, mahbubul hasan <shanto86_at_[hidden]> wrote:

> Hello,
> Here is the proposal<>that I submitted into gsoc site (melange)
> Please let me know if you have any suggestion
> Mahbub
> On Wed, Apr 6, 2011 at 11:46 PM, mahbubul hasan <shanto86_at_[hidden]>wrote:
>> Hi,
>> I have shared the proposal in google doc. I also uploaded it at scribd,
>> here is the link:
>> Mahbub
>> On Wed, Apr 6, 2011 at 3:35 AM, Andrew Sutton <asutton.list_at_[hidden]>wrote:
>>> > It would have been great if you could check my draft proposal and let
>>> me
>>> > know if there is any thing to be fixed, or any other thing that I have
>>> to
>>> > write elaborately.
>>> Can you post a link to a PDF of the file?
>>> Andrew

Boost list run by bdawes at, gregod at, cpdaniel at, john at