Subject: Re: [boost] GSoC Parallel BGP implementation
From: Naresh Reddy Sankapelly (nareshsankapelly_at_[hidden])
Date: 2010-03-20 03:16:44
Thanks.I am enthusiastic to work on the work you have mentioned.
I have a little knowledge about lock-free data structures ,DCAS etc. I would
like to explore those things in detail. I would be happy to have some paper
or resources on those topics. And what are the things that are to be done
exactly on property maps.
> Hi Naresh,
> In additions to Nick's comments, I can help answer some of your other
> > > 2. It would be helpful for me if I can have one more student working
> > > sequential part of graph algorithms. Is it allowed? If it is, and any
> > > interested please reply me back.
> I'm not quite sure I understand what you're asking, but GSoC projects are
> individual efforts. If you propose to do the work, then it should be /your/
> work. There may be some other students working on sequential variants of
> those algorithms, but those would be more or less independent.
> > > 3. Can I get few more details of Computer Vision algorithms?
> > Computer Vision is not exactly my interest area so perhaps someone else
> > go into detail there.
> I copied these over from last year's proposals. I think there's some
> interest in these algorithms (I think the domain came up in some discussion
> between the Geometry/Polygon folks), and I'm fairly certain that there's
> some support in CGAL for computer vision too. That said, I don't know much
> about them either :) Maybe Jeremiah can comment
> Andrew Sutton
> Unsubscribe & other changes:
-- Naresh Reddy S. IIIT-Allahabad
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk