2010 in Snowbird, Utah in connection with the ACM Symposium on
Computational Geometry.
From the papers submitted to the workshop in response to the call for
papers (see below), the programme committee has selected 14 papers for
presentation at the workshop. Please see the programme below and on
the workshop website at http://madalgo.au.dk/massive2010.
Registration is possible through the workshop website at any time
before the workshop, but participants are encouraged to register on or
before May 14, 2010.
----------------------------------------------------------------------
PROGRAMME
----------------------------------------------------------------------
9:00 Opening remarks
9:10-10:30
I/O Efficient Orthogonal Range Reporting in Three and Higher
Dimensions
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
Unit-Time Predecessor Queries ond Massive Data Sets
Andrej Brodnik, John Iacono
Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs
Gerth Stolting Brodal, Erik D. Demaine, Jeremy T. Fineman,
John Iacono, Stefan Langerman, J. Ian Munro
A Lower Bound for Dynamic Approximate Membership Data Structures
Shachar Lovett, Ely Porat
10:30-11:00 Coffee break
11:00-12:00
I/O-Efficient Contour Tree Simplification
Lars Arge, Morten Revsbaek
Spatio-Temporal Range Searching Over Compressed Kinetic Sensor Data
Sorelle A. Friedler, David M. Mount
Online Paging for Flash Memory Devices
Annamaria Kovacs, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu
12:00-13:30 Lunch break
13:30-14:50
Geometric Algorithms for Private-Cache Chip Multiprocessors
Deepak Ajwani, Nodari Sitchinava, Norbert Zeh
Nearest Neighbor Searches on a GPU Using a Minimal kd-Tree
Shawn Brown, Jack Snoeyink
Simulating Parallel Algorithms in the MapReduce Framework
with Applications to Parallel Computational Geometry
Michael T. Goodrich
Filtering: A Technique for Counting Triangles, Computing MSTs
and Clustering in MapReduce
Jake Hofman, Siddharth Suri, Sergei Vassilvitskii
14:50-15:20 Coffee break
15:20-16:20
Fast Pseudo-Random Fingerprints
Yoram Bachrach, Ely Porat
An Optimal Algorithm for the Distinct Elements Problem
Daniel M. Kane, Jelani Nelson, David P. Woodruff
Fast Manhattan Sketches in Data Streams
Jelani Nelson, David P. Woodruff
16:20 Workshop ends
----------------------------------------------------------------------
CALL FOR PAPERS
Second Workshop on Massive Data Algorithmics (MASSIVE 2010)
June 17, 2010
Snowbird, Utah
In connection with SoCG'10 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 13. Authors will be
notified about acceptance by April 27, and final versions will be due
on May 25. 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 17, 2010 in Snowbird, Utah,
immediately following the 26th Annual Symposium on Computational
Geometry (SoCG). Participants should register by May 2 through the
On-line registration service provided through Aarhus University
(online registration will be opened April 1). The workshop will be
relatively informal and have no formal proceedings. The workshop will
this year have the same format as the First Workshop on Massive Data
Algorithmics, held in Aarhus, Denmark in connection with
SoCG'09. 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)
Mark de Berg (Eindhoven)
Gerth S. Brodal (Aarhus and MADALGO)
Ken Clarkson (IBM Almaden)
Graham Cormode (AT&T Research)
Erik Demaine (MIT)
Sudipto Guha (U. Penn)
Sariel Har-Peled (UIUC)
John Iacono (NYU)
Piotr Indyk (MIT)
Martin Isenburg (LLNL)
Christian S. Jensen (Aalborg)
Ulrich Meyer (Frankfurt and MADALGO)
Ian Munro (Waterloo)
Muthu Muthukrishnan (Google)
Mihai Patrascu (AT&T Research)
Ronitt Rubinfeld (MIT and Tel Aviv University)
Peter Sanders (KIT)
Suresh Venkatasubramanian (Utah)
Jeff Vitter (Texas A&M)
Norbert Zeh (Dalhousie, chair)
ORGANIZING COMMITTEE
Gerth S. Brodal (Aarhus and MADALGO)
Else Magaard (Aarhus and MADALGO)
Valerio Pascucci (Utah)
Suresh Venkatasubramanian (Utah)
IMPORTANT DATES
Paper submission: April 14, 2010
Notification of acceptance: April 28, 2010
Early registration deadline: May 2, 2010
Final version due: May 25, 2010
Symposium: June 17, 2010
WEB SITE
Posts
