GSoC 2013: Graph compression and new algorithms

[Animesh Garg]

Hi Team

I am Animesh, phd student in algorithms at berkeley. (IE & OR).

I read through the description of the graph compression and new algorithms project under Pankaj and Aneesh. 

I am interested in working over the summer to contribute to Cassovary. The description of expectations on the website is rather short.

I would wish to discuss the possible expectations (apart from the ones listed) with the concerned mentors. 

Is there a better way to contact other than twitter handles. 

Looking forward. 

Regards

Animesh Garg

[Pankaj Gupta]

Sure, we will contact you on email separately.

Pankaj

--
You received this message because you are subscribed to the Google Groups "Twitter GSOC" group.
To unsubscribe from this group and stop receiving emails from it, send an email to twitter-gsoc...@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.
 
 

[Thanos Papaoikonomou]

Hi all,

I am a PhD student in social network analysis. I have some experience with other graph-db's like Neo4j or graph mining libraries like SNAP.
I ld be also interested in working on the Cassovary project during this summer.
As it appears on the website, most of the effort with be spent on the implementation of graph compression algorithms. Could you elaborate on the expected goals for this project here or via a separate e-mail?

Thank you for your time,
Best regards,
Thanos

[Aneesh Sharma]

Hi Thanos,

Thanks very much for the interest! We don't have a fixed implementation in mind that we want to enforce for the graph compression project. The scope depends primarily on your interest/abilities in being able to think about various techniques and evaluate CPU/memory trade-offs. As an example, introduction of a novel compression technique would also be very welcome.

Hope that clarifies things!
Aneesh.