UID:
almahu_9949512978302882
Format:
PDFs (vi, 246 pages) :
,
illustrations.
ISBN:
9781611977714
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:
Exact algorithms for group closeness centrality / Luca Pascal Staus, Christian Komusiewicz, Nils Morawietz, Frank Sommer -- On the group coverage centrality problem : parameterized complexity and heuristics / Christian Komusiewicz, Jannis Schramek, Frank Sommer -- Engineering fully dynamic [delta]-orientation algorithms / Jannick Borowitz, Ernestine Grossmann, Christian Schulz -- On improving contraction hierarchies using distance group partitions / Claudius Proissl -- Faster parallel exact density peaks clustering / Yihao Huang, Shangdi Yu, Julian Shun -- Integer programming for the maximum cut problem : a refined model and implications for branching / Jonas Charfreitag, Sven Mallach, Petra Mutzel -- A reduced cost-based model strengthening method / Lukas Schürmann, Petra Mutzel -- Learned interpolation for better streaming quantile approximation with worst-case guarantees / Nicholas Schiefer, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal, Tal Wagner -- Irreducibility of recombination Markov chains in the triangular lattice / Sarah Cannon -- Generalized scaling for the constrained maximum-entropy sampling problem / Zhongzhu Chen, Marcia Fampa, Jon Lee -- An exponentially smaller kernel for exact weighted clique decomposition / Shweta Jain, Yosuke Mizutani, Blair D. Sullivan -- Accelerating distributed matrix multiplication with 4-dimensional polynomial codes / Roy Nissim, Oded Schwartz -- LAHypergraph : parallel hypergraph analytics in the language of linear algebra / Luanzheng Guo, Jesun Firoz, Gokcen Kestor -- Solving max-plus linear systems by level sparsification / Yuki Nishida -- Fast first-order methods for monotone strongly DR-submodular maximization / Maryam Fazel, Omid Sadeghi -- Exponential convergence of sinkhorn under regularization scheduling / Jingbang Chen, Li Chen, Yang P. Liu, Richard Peng, Arvind Ramaswami -- A breakpoints based method for the maximum diversity and dispersion problems / Dorit S. Hochbaum, Zhihao Liu, Olivier Goldschmidt -- Elimination techniques for algorithmic differentiation revisited / Uwe Naumann, Erik Schneidereit, Simon Märtens, Markus Towara -- Singleton sieving : overcoming the memory/speed trade-off in exascale k-mer analysis / Hunter McCoy, Steven Hofmey, Katherine Yelick, Prashant Pandey -- Small searchable K-spectra via subset rank queries on the spectral Burrows-Wheeler transform / Jarno N. Alanko, Simon J. Puglisi, Jaakko Vuohtoniemi -- Computing boundary crossing probabilities of general empirical processes / Rigel Galgana, Takehiro Oyakawa, Amy Greenwald.
,
Mode of access: World Wide Web.
,
System requirements: Adobe Acrobat Reader.
Language:
English
