MMDS 2006. Workshop on Algorithms for Modern Massive Data Sets

Stanford University and Yahoo! Research
June 21–24, 2006

Updates

Location

The registration and talks will take place at the Annenberg Auditorium, 435 Lasuen Mall, Stanford, CA 94305. Click here for directions and maps.

The poster session and banquet will take place at the Wallenberg Hall on Friday. There will also be a welcome reception on Wednesday evening at the New Guinea Garden and a closing reception on Saturday evening (location pending).

Registration

Added 6/10/06: If you are unable to attend the workshop for any reason, please do let us know so that we may register others who are eager to attend. Requests to participate in the workshop will now be considered on a case-by-case basis (depending on cancellations, if any).

Added 6/9/06: If you are a speaker or a poster presenter who has not registered, please send an e-mail to drinep@cs.rpi.edu.

Added 6/9/06: Thank you all for the warm response — we received more than 70 new registrations yesterday and are now looking at a workshop with 200 participants. As such, the registration is now officially closed. We will honor your registration as long as you submitted it before the registration page was taken off-line.

REGISTRATION CLOSED

Please note that, due to security concerns at Yahoo!, registration is required for everyone (including speakers and Stanford affiliated participants). Registration is free for speakers, poster presenters, students, postdocs, anyone with Yahoo! or Stanford affiliation, $50 for academic participants, and $200 for industrial/government participants.

Objective

Explore novel techniques for modeling and analyzing massive, high-dimensional, and nonlinear-structured data. Bring together computer scientists, computational and applied mathematicians, statisticians, and practitioners to promote cross-fertilization of ideas.

Theory

Large scale numerical linear algebra; kernel-based nonlinear structure extraction; tensor-based multilinear structure extraction; missing value estimation; sampling-based algorithms.

Applications

Analyzing microarray data and high-throughput chemical data in pharmaceutical applications; identifying gene products, elucidating protein folding pathways; detecting and classifying cancer; modeling combinational structure of large social, computer, and communication networks; identifying potential terrorist cells in communication networks; identifying noisy targets and faces in realistic settings; improving internet search engines; analyzing remote sensing data for environmental planning, weather forecasting, and public health contamination.

Organizers

Gene Golub, Michael Mahoney, Petros Drineas, Lek-Heng Lim

Confirmed Speakers

Orly Alter University of Texas at Austin
Dimitris Achlioptas Microsoft Research
Brett Bader Sandia National Laboratory
Michael W. Berry University of Tennessee at Knoxville
Daniel Boley University of Minnesota at Twin Cities
Rasmus Bro Royal Veterinary and Agricultural University Denmark
Gunnar E. Carlsson Stanford University
Moses Charikar Princeton University
Pierre Comon University of Nice Sophia-Antipolis
Inderjit S. Dhillon University of Texas at Austin
Chris Ding Lawrence Berkeley National Laboratory
David Donoho Stanford University
Lars Elden Linkoping University
Shmuel Friedland University of Illinois at Chicago
Apostolos Gerasoulis Rutgers University & Ask.com
Anna C. Gilbert University of Michigan at Ann Arbor
Sudipto Guha University of Pennsylvania
Trevor Hastie Stanford University
Bruce Hendrickson Sandia National Laboratory
Piotr Indyk Massachusetts Institute of Technology
Alfred Inselberg Tel Aviv University
Ravi Kannan Yale University
Tamara G. Kolda Sandia National Laboratory
Lieven de Lathauwer Ecole Nationale Superieure d'Electronique et de ses Applications
Frank McSherry Microsoft Research
Bart de Moor Katholieke Universiteit Leuven
S. Muthu Muthukrishnan Google Inc.
Dianne O'Leary University of Maryland at College Park
Art Owen Stanford University
Haesun Park Georgia Institute of Technology
Bob Plemmons Wake Forest University
Tomaso A. Poggio Massachusetts Institute of Technology
Liqun Qi City University of Hong Kong
Prabhakar Raghavan Yahoo! Research
Vin de Silva Pomona College
Stephen Smale University of California at Berkeley
Daniel A. Spielman Yale University
G.W. Stewart University of Maryland at College Park
Martin Strauss University of Michigan at Ann Arbor
Robert Tibshirani Stanford University
Joel A. Tropp University of Michigan at Ann Arbor
Eugene E. Tyrtyshnikov Russian Academy of Sciences
M. Alex O. Vasilescu Massachusetts Institute of Technology
Santosh S. Vempala Massachusetts Institute of Technology
Tao Yang University of California at Santa Barbara & Ask.com
Hongyuan Zha Pennsylvania State University
Tong Zhang Yahoo! Research

Housing

Added 5/22/06: Here is a message from Gene Golub with some suggestions of inexpensive housing options.

We do not have a preferred hotel. Participants are free to choose from a wide range of accommodation options in the Stanford/Palo Alto/Menlo Park vicinity. The Stanford campus is easily accessible via the free Marguerite Shuttle, the Caltrain rail service, and the VTA buses and light rail.

Directions

Added 6/10/06: Stanford Parking & Transportation Services (P&TS) is available if you need assistance planning your trip. They can talk you through the best route — from your front door to campus. Contact the P&TS office at 650-723-9362, email at transportation@stanford.edu.

Click here for directions to Stanford and here for further information on public transport. If you need shuttle transportation to/from the airport, please make your own reservations, preferably 24 hours in advance:

Schedule and Abstracts

We have prepared a detailed schedule containing the abstracts of all talks and tutorials. Here is a brief schedule for an overview.

A preliminary list of poster presentations is now available.

We have received unexpected, overwhelming response to this workshop. Despite extending the workshop program by an additional day, we are still unable to accommodate any requests for contributed talks. We find it a pity to let the many excellent contributed talks proposed go unnoticed and thus a poster session will be arranged for any participants who are interested to publicize their work (this workshop is expected to be well-attended by members of the Stanford Industrial Affiliates).

Conference Proceedings

We expect to publish the proceedings of this workshop. More details will be forthcoming.

Flyer

You could help publicize this event by posting this flyer in your department.

Contact

For further information regarding the workshop, please email Lek-Heng Lim at lekheng@cs.stanford.edu

Sponsors

National Science Foundation Forum Logo Yahoo! Research Ask.com