UID:
almahu_9949119651102882
Format:
PDFs (239 pages) :
,
illustrations
ISBN:
9781611976830
Content:
The SIAM Conference on Applied and Computational Discrete Algorithms is a new conference that brings together researchers who design and study combinatorial and graph algorithms motivated by applications. ACDA is organized by SIAM under the auspices of the SIAM Activity Group on Applied and Computational Discrete Algorithms. ACDA subsumes the long-running series of SIAM Workshops on Combinatorial Scientific Computing, and expands its scope to applications of discrete models and algorithms across all areas in the physical and life sciences and engineering, the social and information sciences, and anywhere discrete mathematical techniques are used to formulate and solve problems in the world. ACDA invites papers on the formulation of combinatorial problems from applications; theoretical analyses; design of algorithms; computational evaluation of the algorithms; and deployment of the resulting software to enable applications.
Note:
Queues with small advice / Michael Mitzenmacher -- The quantile matching problem and point cloud registration / Stéphane Chrétien, Oya Ekin Karaşan, Ecenur Oguz, and Mustafa Ç. Pınar -- Using predicted weights for ad delivery / Thomas Lavastida, Benjamin Moseley, R. Ravi, and Chenyang Xu -- Fully-dynamic weighted matching approximation in practice / Eugenio Angriman, Henning Meyerhenke, Christian Schulz, and Bora Uçar -- A parallel approximation algorithm for maximizing submodular b-matching / S.M Ferdous, Alex Pothen, Arif Khan, Ajay Panyala, and Mahantesh Halappanavar -- Non-monotone adaptive submodular meta-learning / Shaojie Tang and Jing Yuan -- Improving tug-of-war sketch using control-variates method / Rameshwar Pratap, Bhisham Dev Verma, and Raghav Kulkarni -- On the difference between search space size and query complexity in contraction hierarchies / Claudius Proissl and Tobias Rupp -- Fairmandering : a column generation heuristic for fairness-optimized political districting / Wes Gurnee and David B. Shmoys -- Faster parallel multiterminal cuts / Monika Henzinger, Alexander Noe, and Christian Schulz -- Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition / Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, and Blair D. Sullivan -- BELLA: Berkeley efficient long-read to long-read aligner and overlapper / Giulia Guidi, Marquita Ellis, Daniel Rokhsar, Katherine Yelick, and Aydın Buluç -- Parallel clique counting and peeling algorithms / Jessica Shi, Laxman Dhulipala, and Julian Shun -- A message-driven, multi-GPU parallel sparse triangular solver / Nan Ding, Yang Liu, Samuel Williams, and Xiaoye S. Li -- A dynamic program for computing the joint cumulative distribution function of order statistics / Rigel Galgana, Cengke Shi, Amy Greenwald, and Takehiro Oyakawa -- Efficient signed backward substitution for piecewise affine functions via path problems in a directed acyclic graph / Torsten Bosse, Ralf Seidler, and H. Martin Bücker -- Multidimensional included and excluded sums / Helen Xu, Sean Fraser, and Charles E. Leiserson -- Efficient parallel sparse symmetric tucker decomposition for high-order tensors / Shruti Shivakumar, Jiajia Li, Ramakrishnan Kannan, and Srinivas Aluru -- The traveling firefighter problem / Majid Farhadi, Alejandro Toriello, and Prasad Tetali -- Search and evacuation with a near majority of faulty agents / Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, and Grzegorz Stachowiak -- On the request-trip-vehicle assignment problem / J. Carlos Martínez Mori and Samitha Samaranayake.
,
Mode of access: World Wide Web.
,
System requirements: Adobe Acrobat Reader.
Language:
English
