Archive for July, 2010

WSDM 2010 

July 23, 2010 Leave a comment

4th ACM International Conference on Web Search and Data Mining (WSDM2011) is scheduled on February 9-12, 2011, Hong Kong. The deadline for submission this conference is August 1st, 2010.


WAW 2010

July 23, 2010 Leave a comment

7th Workshop on Algorithms and Models for the Web Graph (WAW 2010) is will take place on December 13-14, 2010 in Stanford University, CA, USA. The deadline for paper submission for this workshop is September 1st, 2010. For more information, please refer to Call for Papers WAW 2010 .

Innovations in Computer Science – ICS 2011

July 15, 2010 1 comment

2nd Symposium on Innovations in Computer Science (ICS 2011) will be held in Beijing, China, January 7-9, 2011. This new theoretical computer science (TCS) conference is broadly targeted to promote high quality and innovative research such as those that introduce a new concept, opening a new line of inquiry within traditional or cross-disciplinary areas, or introducing new techniques or new applications of known techniques.

Important Dates
Submission: Monday, August 2, 2010, 23:59, US PDT
Notification: Tuesday, October 4, 2010, 23:59, US PDT

For more information, please refer to ICS 2011 Web Page.

Leading Researchers and Groups in Social Networks with Computer Science Flavour

July 3, 2010 1 comment

The following are a few important leading researchers and groups working on social networks with computer science

1. Jon M. Kleinberg

2. Christos Faloutsos

3. Eva Tardos

4. Jure Leskovec

5. Ashish Goel

6. Nikhil Devanur

7. Michael Mahoney

8. Michael Kearns

9. Nicole Immorlica

10. Deepayan Chakrabarti

11. David Kempe

12. Krishna P. Gummadi

13. Tanya Berger-Wolf

FOCS 2010 Accepted Papers

July 3, 2010 Leave a comment

Here is the link to FOCS 2010 accepted papers.

The following are a few important papers related to (social) networks (in FOCS 2010 accepted papers):

Minimum-Cost Network Design with (Dis)economies of Scale
Authors: Matthew Andrews and Spyridon Antonakopoulos and Lisa Zhang, Bell Laboratories, 600-700 Mountain Avenue, Murray Hill, NJ 07974

One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk
Authors: Ashish Goel (Stanford University) Ian Post (Stanford University)

Fast approximation algorithms for flow and cut-based problems in undirected graphs
Author: Aleksander Madry, MIT

Yahoo! Key Scientific Challenge (KSC) Program…

July 3, 2010 Leave a comment

Yahoo! Labs has announced the winners of KSC program 2010. For more details,
please go through Yahoo! KSC official website.