UID:
almahu_9948153768702882
Format:
PDFs (3-165 pages) :
,
illustrations
ISBN:
9781611972870
Content:
The Workshop on Algorithm Engineering and Experiments (ALENEX07) will be held in New Orleans, Louisiana, on January 6, 2007, at the Astor Crowne Plaza, New Orleans, Louisiana. The aim of the ALENEX workshop is to provide a forum for presentation of original research in the implementation and experimental evaluation of algorithms and data structures. We invite submissions that present significant case studies in experimental analysis (such studies may tighten, extend, or otherwise improve current theoretical results) or in the implementation, testing, and evaluation of algorithms for realistic environments and scenarios, including specific applied areas (including databases, networks, operations research, computational biology and physics, computational geometry, and the world wide web) that present unique challenges in their underlying algorithmic problems. We also invite submissions that address methodological issues and standards in the context of empirical research on algorithms and data structures. The scientific program will include time for discussion and debate of topics in this rapidly evolving research area.
Note:
Improved external memory BFS implementations / Deepak Ajwani, Ulrich Meyer, and Vitaly Osipov -- Computing visibility on terrains in external memory / Herman Haverkort, Laura Toma, and Yi Zhuang -- An experimental study of a parallel shortest path algorithm for solving large-scale graph instances / Kamesh Madduri, David A. Bader, Jonathan W. Berry, and Joseph R. Crobak -- Computing many-to-many shortest paths using highway hierarchies / Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, and Dorothea Wagner -- In transit to constant time shortest-path queries in road networks / Holger Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, and Dominik Schultes -- Practical entropy-compressed rank/select dictionary / Daisuke Okanohara and Kunihiko Sadakane -- Intersection in Integer Inverted Indices / Peter Sanders and Frederik Transier -- Faster filters for approximate string matching / Juha Kärkkäinen and Joong Chae Na -- Algorithms to take advantage of hardware prefetching / Shen Pan, Cary Cherng, Kevin Dick, and Richard E. Ladner -- Linearization : locally self-stabilizing sorting in graphs / Melih Onus, Andrea Richa, and Christian Scheideler -- Maximizing throughput in minimum rounds in an application-level relay service / Fred Annexstein, Kenneth A. Berman, Svetlana Strunjaš, and Chad Yoshikawa -- Locating guards for visibility coverage of polygons / Yoav Amit, Joseph S. B. Mitchell, and Eli Packer -- Engineering an efficient canonical labeling tool for large and sparse graphs / Tommi Junttila and Petteri Kaski -- ScrewBox : a randomized certifying graph-non-isomorphism algorithm / Martin Kutz and Pascal Schweitzer -- 0/1 vertex and facet enumeration with BDDs / Markus Behle and Friedrich Eisenbrand.
,
Mode of access: World Wide Web.
,
System requirements: Adobe Acrobat Reader.
Language:
English
Bookmarklink
