[compgeom-announce] Workshop on Massive Data Algorithmics program and registration information

[Lars Arge <large@madalgo.au.dk>]

The first Workshop on Massive Data Algorithmics will be held on June 11,
2009 at MADALGO, Aarhus University, Denmark (in connection with the 2009
Symposium on Computational Geometry).

 From the papers submitted as a result of the call-for-papers (see
below), the program committee has selected 15 papers for presentation at
the workshop. Please see the program below and on the workshop website
www.madalgo.au.dk/massive2009. Participants in the workshop should
register through the Symposium on Computational Geometry website
www.madalgo.au.dk/socg2009/. The early registration deadline is May 1.

Program (Thursday June 11)
--------------------------

9:00 Opening remarks

9:00-10:20

Pipelined Streaming: Extraction of Elevation Contours from LIDAR Points
Martin Isenburg, Jack Snoeyink and Yuanxin Liu

Reducing the Memory Required to Find a Geodesic Shortest Path on a Large
Mesh
Vishal Verma and Jack Snoeyink

Spatial Streaming for Point Clouds and Meshes with Labels and Properties
Shawn Brown, Catalin Constantin and Jack Snoeyink

Streaming Connected Component Computation for Trillion Voxel Images
Martin Isenburg and Jonathan Shewchuk

10:20-11:00 Coffee break

11:00-12:00

On Computational Models for Flash Memory Devices
Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer and
Gabriel Moruz

Fault Tolerant External Memory Algorithms
Allan Grønlund Jørgensen, Gerth Stølting Brodal and Thomas Mølhave

On P-complete Problems in Memory Hierarchy Models
Deepak Ajwani

12:00-13:30 Lunch

13:30-14:50

Parallel Sparse Matrix-Vector and Matrix-Transpose-Vector Multiplication
Using Compressed Sparse Blocks
Aydin Buluç, Jeremy Fineman, Matteo Frigo, John Gilbert and
Charles Leiserson

Parallel I/O-Efficient State Space Generation
Jiri Barnat, Lubos Brim and Pavel Simecek

Scalable Distributed External Memory Sorting
Mirko Rahn, Peter Sanders and Johannes Singler

Building a Parallel Pipelined External Memory Algorithm Library
Andreas Beckmann, Roman Dementiev and Johannes Singler

14:50-15:20 Coffee break

15:20-16:40

Simple I/O-efficient Flow Accumulation on Grid Terrains
Herman Haverkort and Jeffrey Janssen

Bipartite Graph Matchings in the Semi-Streaming Model
Sebastian Eggert, Lasse Kliemann and Anand Srivastav

Computing Cosine and Lift Measures via Biased Sampling
Andrea Campagna and Rasmus Pagh

External Sampling
Alexandr Andoni, Piotr Indyk, Krzysztof Onak and Ronitt Rubinfeld

16:40 Workshop ends


------------------------------------------------------------------------

          Workshop on Massive Data Algorithmics

                     June 11, 2009
               Aarhus University, Denmark

       In connection with SoCG'09 and organized by
      Center for Massive Data Algorithmics (MADALGO)

Aim and Scope
-------------
Tremendous advances in our ability to acquire, store and process data,
as well as the pervasive use of computers in general, have resulted in a
spectacular increase in the amount of data being collected. This
availability of high-quality data has led to major advances in both
science and industry. In general, society is becoming increasingly data
driven, and this trend is likely to continue in the coming years.

The increasing number of applications processing massive data means that
in general focus on algorithm efficiency is increasing. However, the
large size of the data, and/or the small size of many modern computing
devices, also means that issues such as memory hierarchy architecture
often play a crucial role in algorithm efficiency. Thus the availability
of massive data also means many new challenges for algorithm designers.

The aim of the workshop on massive data algorithmcs is to provide a
forum for researchers from both academia and industry interested in
algorithms for massive dataset problems. The scope of the workshop
includes both fundamental algorithmic problems involving massive data,
as well as algorithms for more specialized problems in, e.g., graphics,
databases, statistics and bioinformatics. Topics of interest include,
but are not limited to
                    - I/O-efficient algorithms
                    - Cache-oblivious algorithms
                    - Memory hierarchy efficient algorithms
                    - Streaming algorithms
                    - Sublinear algorithms
                    - Parallel algorithms for massive data problem
                    - Engineering massive data algorithms

Paper submission:
-----------------
We invite submissions of extended abstracts (at most 10 pages not
counting references) of original research. Extended abstract should be
submitted through the EasyChair website by April 3 - details will appear
on the workshop website www.madalgo.au.dk/massive2009. Authors will be
notified about acceptance by April 17, and final versions will be due on
May 29. Accepted extended abstracts will be collected in a booklet,
which will be distributed at the workshop. There will be no formal
proceedings, so work presented at the workshop can also be (or have
been) presented at other conferences. An author of each accepted
abstract is expected to give a presentation of the abstract at the workshop.

Participation:
--------------
The workshop will take place on June 11 2009 in Aarhus, Denmark,
immediately following the 25th Annual Symposium on Computational
Geometry (SoCG). Participants should register by May 1 through the SoCG
website http://www.madalgo.au.dk/socg2009/. The workshop will be
relatively informal and have no formal proceedings. However, if the
workshop is successful, it is the plan to consider moving to a more
formal symposium format. Thus all researchers interested in massive data
algorithmics are encouraged to attend the workshop.

Program committee:
------------------

Pankaj Agarwal (Duke)
Lars Arge (Aarhus and MADALGO, co-chair)
Guy Blelloch (CMU)
Gerth S. Brodal (Aarhus and MADALGO, co-chair)
Ken Clarkson (IBM Almaden)
Graham Cormode (AT&T Labs - Research)
Erik Demaine (MIT and MADALGO)
Sudipto Guha (U. Penn)
Sariel Har-Peled (UIUC)
John Iacono (NYU)
Piotr Indyk (MIT and MADALGO)
Martin Isenburg (LNLL)
Christian S. Jensen (Aalborg)
Ravi Kumar (Yahoo! Research)
Charles Leiserson (MIT)
Kurt Mehlhorn (MPI and MADALGO)
Ulrich Meyer (Frankfurt and MADALGO)
Ian Munro (Waterloo)
Muthu Muthukrishnan (Google)
Ronitt Rubinfeld (MIT and Tel Aviv University)
Peter Sanders (Karlsruhe)
Suresh Venkatasubramanian (Utah)
Jeff Vitter (Texas A&M)
Norbert Zeh (Dalhausie)

Organizing committee:
---------------------
Lars Arge (MADALGO, Aarhus)
Gerth S. Brodal (MADALGO, Aarhus)
Else Magård (MADALGO, Aarhus)
Dorthe Haagen Nielsen (CS, Aarhus)

Important dates:
----------------
Paper submission: April 3
Notification of acceptance: April 17
Early registration deadline: May 1
Final version due: May 29
Symposium: June 11, 2009

More information:
-----------------
www.madalgo.au.dk/massive2009

About MADALGO:
--------------
Center for MAssive Data ALGOrithmics is a major basic research center
funded by the Danish National Research Foundation. The center is located
at the Department of Computer Science, Aarhus University, Denmark,
but also includes researchers at CSAIL, Massachusetts Institute of
Technology in the US, and at the Max Planck Institute for Informatics
and at Frankfurt University in Germany. The center covers all areas of
the design, analysis and implementation of algorithms and data
structures for processing massive data (interpreted broadly to cover
computations where data is large compared to the computational
resources), but with a main focus on I/O-efficient, cache-oblivious and
data stream algorithms. Refer to www.madalgo.au.dk for more informa

-- 
You are currently subscribed to compgeom-announce.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/compgeom-announce