Mailing-List: contact user-help@giraph.apache.org; run by ezmlm
Precedence: bulk
Reply-To: user@giraph.apache.org
Received-SPF: pass (athena.apache.org: domain of mirko.kaempf@cloudera.com
 designates 209.85.128.179 as permitted sender)
MIME-Version: 1.0
In-Reply-To: <5323724D.9040304@apache.org>
References: <E50D5673-5109-4614-8C1C-16108723FB8E@menttis.com>
	<5323724D.9040304@apache.org>
Date: Sat, 15 Mar 2014 13:34:05 +0100
Message-ID: 
 <CADzcq5_bz-iOJhbHgedopq1GOqiCHUnUoMjnB-t5JFCxqnkt=Q@mail.gmail.com>
Subject: Re: GSoC 2014 - Strongly Connected Components
From: =?ISO-8859-1?Q?Mirko_K=E4mpf?= <mirko.kaempf@cloudera.com>
To: user@giraph.apache.org, aching@apache.org
Content-Type: multipart/alternative; boundary=047d7b671f34f5b4cf04f4a46665

--047d7b671f34f5b4cf04f4a46665
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable

Hi Gianluca,

thanks for sharing your ideas and sending your proposal.
Your approach sounds promising and I am very interested
in supporting your work.

I am not an official member of the Apache Giraph project
at the moment, so my question goes to Avery:
Would it be possible for me to become a mentor for Gianluca's project?

Best wishes
Mirko


On Fri, Mar 14, 2014 at 10:19 PM, Avery Ching <aching@apache.org> wrote:

> This is a great idea.  Unfortunately, I'm a little bandwidth limited, but
> I hope someone can help mentor you!
>
>
> On 3/14/14, 1:26 PM, Gianluca Righetto wrote:
>
>> Hello everyone,
>>
>> I've been working with Giraph for some time now and I'd like to make som=
e
>> contributions back to the project through Google Summer of Code.
>> I wrote a project proposal to implement an algorithm for finding Strongl=
y
>> Connected Components in a graph, based on recently published research
>> papers. The main idea of the algorithm is to find clusters (or groups) i=
n
>> the graph and it's arguably more insightful than the currently available
>> Connected Components algorithm.
>> So, if there's any Apache member interested in mentoring this project,
>> please, feel free to contact me.
>> And any kind of feedback will be greatly appreciated.
>>
>> You can find the document in Google Drive here: http://goo.gl/1fqqui
>>
>> Thanks,
>> Gianluca Righetto
>>
>
>


--=20
--=20
Mirko K=E4mpf

*Trainer* @ Cloudera

tel: +49 *176 20 63 51 99*
skype: *kamir1604*
mirko@cloudera.com

--047d7b671f34f5b4cf04f4a46665
Content-Type: text/html; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">Hi Gianluca,=A0<div><br></div><div>thanks for sharing your=
 ideas and sending your proposal.=A0</div><div>Your approach sounds promisi=
ng and I am very interested</div><div>in supporting your work.=A0</div><div=
><br>
</div><div>I am not an official member of the Apache Giraph project=A0</div=
><div>at the moment, so my question goes to Avery:</div><div>Would it be po=
ssible for me to become a mentor for Gianluca&#39;s project?</div><div><br>
</div><div>Best wishes</div><div>Mirko</div><div><br></div><div>=A0</div><d=
iv><br></div></div><div class=3D"gmail_extra"><br><br><div class=3D"gmail_q=
uote">On Fri, Mar 14, 2014 at 10:19 PM, Avery Ching <span dir=3D"ltr">&lt;<=
a href=3D"mailto:aching@apache.org" target=3D"_blank">aching@apache.org</a>=
&gt;</span> wrote:<br>
<blockquote class=3D"gmail_quote" style=3D"margin:0 0 0 .8ex;border-left:1p=
x #ccc solid;padding-left:1ex">This is a great idea. =A0Unfortunately, I=
9;m a little bandwidth limited, but I hope someone can help mentor you!<div=
 class=3D"HOEnZb">
<div class=3D"h5"><br>
<br>
On 3/14/14, 1:26 PM, Gianluca Righetto wrote:<br>
<blockquote class=3D"gmail_quote" style=3D"margin:0 0 0 .8ex;border-left:1p=
x #ccc solid;padding-left:1ex">
Hello everyone,<br>
<br>
I&#39;ve been working with Giraph for some time now and I&#39;d like to mak=
e some contributions back to the project through Google Summer of Code.<br>
I wrote a project proposal to implement an algorithm for finding Strongly C=
onnected Components in a graph, based on recently published research papers=
. The main idea of the algorithm is to find clusters (or groups) in the gra=
ph and it&#39;s arguably more insightful than the currently available Conne=
cted Components algorithm.<br>

So, if there&#39;s any Apache member interested in mentoring this project, =
please, feel free to contact me.<br>
And any kind of feedback will be greatly appreciated.<br>
<br>
You can find the document in Google Drive here: <a href=3D"http://goo.gl/1f=
qqui" target=3D"_blank">http://goo.gl/1fqqui</a><br>
<br>
Thanks,<br>
Gianluca Righetto<br>
</blockquote>
<br>
</div></div></blockquote></div><br><br clear=3D"all"><div><br></div>-- <br>=
<div>--=A0<br>Mirko K=E4mpf</div><div><br><b>Trainer</b>=A0@ Cloudera<br><b=
r></div><div>tel: +49=A0<b>176 20 63 51 99</b><br>skype:=A0<b>kamir1604</b>=
</div><div>
<a href=3D"mailto:mirko@cloudera.com" target=3D"_blank">mirko@cloudera.com<=
/a><br></div><br>
</div>

--047d7b671f34f5b4cf04f4a46665--