Program ScheduleAll sessions will take place in Pavilion D unless otherwise noted. 8:30 AM Continental Breakfast (Junior Ballroom C&D) 9:00 AM Computational Challenges from the Tree of Life (pdf) 10:00 AM Coffee Break (Junior Ballroom C&D) 10:20 AM Drawing Graphs to Speed Up Shortest-Path Computations (pdf) 10:40 AM An Efficient External Memory Shortest Path Algorithm (pdf) 11:00 AM An Experimental Analysis of Change Propagation in Dynamic Trees (pdf) 11:20 AM Flows over Time: Towards a more Realistic and Computationally Tractable Model (pdf) 11:40 AM Solving the Prize-Collecting Steiner Tree Problem to Optimality (pdf) 12:00 PM Lunch (attendees on their own) 1:20 PM An Incomplex Algorithm for Fast Suffix Array Construction (pdf) 1:40 PM Better External Memory Suffix Array Construction (pdf) 2:00 PM Counting and Enumerating Pseudo-triangulations with the Greedy Flip Algorithm (pdf) 2:20 PM Hardware-Assisted Natural Neighbor Interpolation (pdf) 2:40 PM Approximating the True Evolutionary Distance Between Two Genomes (pdf) 3:00 PM Coffee Break (Junior Ballroom C&D) 3:20 PM On the Adaptiveness of Quicksort (pdf) 3:40 PM How Caching Affects Hashing (pdf) 4:00 PM Extending STL Maps using LBSTs (pdf) 4:20 PM An Experimental Study of Different Approaches to Solve the Market Equilibrium Problem (pdf) 4:40 PM A New Decoding Algorithm for Statistical Machine Translation: Design and Implementation (pdf) 5:00 PM ALENEX Business Meeting 6:00 PM ACM-SIAM SODA Welcome Reception (Junior Ballroom C&D) |
|
|
Last Edited: July 20, 2004 |