[prev in list] [next in list] [prev in thread] [next in thread] 

List:       kde-devel
Subject:    [GSoC 2014] Enhanced Searching in KMail
From:       Nikhar Agrawal <nikharagrawal2006 () gmail ! com>
Date:       2014-02-12 19:52:03
Message-ID: CAOqX9d_+E4BQ2xY57UfdReA5=eTadt7DPRZPWH7gNKcgvrKDVg () mail ! gmail ! com
[Download RAW message or body]

[Attachment #2 (multipart/alternative)]


Hi,
I am Nikhar Agrawal, currently studying in my third year at IIIT-H,
pursuing Computer Science and Engineering. I have been a GSoC 2013
participant for Boost C++ libraries and managed to successfully merge my
project into Boost trunk.

As a part of my course on Information Retrieval and Extraction, I recently
did a project on searching for queries on the latest 40 gb wikipedia dump.
I was going through the KDE ideas page and got pretty excited when I read
about
Enhanced Searching in KMail project.  I couldn't find the contact details
of respective mentors. Hence, I am sending the mail to the entire list.

Could someone guide me as to what are the next steps I should take?

Thanks.

[Attachment #5 (text/html)]

<div dir="ltr"><div><div><div>Hi,<br></div>I am Nikhar Agrawal, currently studying in \
my  third year at IIIT-H, pursuing Computer Science and Engineering. I have 
been a GSoC 2013 participant for Boost C++ libraries and managed to 
successfully merge my project into Boost trunk.<br>
<br></div>As a part of my course on Information Retrieval and 
Extraction, I recently did a project on searching for queries on the latest 40 gb
 wikipedia dump. I was going through the KDE ideas page and got pretty excited 
when I read about <br><h4><span class="" id="Enhanced_Searching_in_KMail">Enhanced \
Searching in KMail</span></h4> project.  I couldn&#39;t find the contact details of \
respective mentors. Hence, I am sending the mail to the entire list.<br> <br>Could \
someone guide me as to what are the next steps I should \
take?<br><br></div>Thanks.<br></div>



>> Visit http://mail.kde.org/mailman/listinfo/kde-devel#unsub to unsubscribe <<


[prev in list] [next in list] [prev in thread] [next in thread]