ParkView: Visualizing Monotone Interleavings

Συγγραφείς: Beurskens, Thijs, Van Den Broek, Steven, Simons, Arjen, Sonke, Willem, Verbeek, Kevin, Ophelders, Tim, Hoffmann, Michael, Speckmann, Bettina

Πηγή: 2025 IEEE 18th Pacific Visualization Conference (PacificVis) PACIFICVIS Pacific Visualization Conference (PacificVis), 2025 IEEE 18th. :118-127 Apr, 2025

Relation: 2025 IEEE 18th Pacific Visualization Conference (PacificVis)

A theory of initialisation's impact on specialisation*

Συγγραφείς: Jarvis, Devon, Lee, Sebastian, Carla Juliette Domine, Clementine, Saxe, Andrew M., Sarao Mannelli, Stefano, 1992

Πηγή: JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT. 2025(11)

Θεματικοί όροι: analysis of algorithms, online dynamics, deep learning, machine learning

Περιγραφή αρχείου: electronic

Σύνδεσμος πρόσβασης: https://research.chalmers.se/publication/549475
https://research.chalmers.se/publication/549475/file/549475_Fulltext.pdf

Enumerating Minimal Connected Dominating Sets: Enumerating minimal connected dominating sets

Συγγραφείς: Faisal Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann

Συνεισφορές: Faisal N. Abu-Khzam and Henning Fernau and Benjamin Gras and Mathieu Liedloff and Kevin Mann

Πηγή: SIAM Journal on Discrete Mathematics. 39:946-972

Θεματικοί όροι: connected domination, Connectivity, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), enumeration problems, degenerate graphs, Graph algorithms (graph-theoretic aspects), Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, Analysis of algorithms, ddc:004, Enumeration in graph theory, Nonnumerical algorithms

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.1

Accelerating Transfer Function Update for Distance Map based Volume Rendering

Συγγραφείς: Rauter, Michael, Zimmermann, Lukas, Zeilinger, Markus

Πηγή: 2024 IEEE Visualization and Visual Analytics (VIS) VIS Visualization and Visual Analytics (VIS), 2024 IEEE. :171-175 Oct, 2024

Relation: 2024 IEEE Visualization and Visual Analytics (VIS)

Unary NP-hardness of transportation and batching scheduling to minimize the total weighted completion time

Συγγραφείς: Wei, Hongjun, Gao, Yuan, Yuan, Jinjiang

Πηγή: Discrete Applied Mathematics. 369:45-52

Θεματικοί όροι: transportation, Transportation, logistics and supply chain management, total weighted completion time, Deterministic scheduling theory in operations research, Analysis of algorithms and problem complexity, batching scheduling, unary NP-hard

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/8028611
https://doi.org/10.1016/j.dam.2025.02.023

Stable Approximation Algorithms for Dominating Set and Independent Set: Stable approximation algorithms for dominating set and independent set

Συγγραφείς: Mark de Berg, Arpan Sadhukhan, Frits Spieksma

Συνεισφορές: Mark de Berg and Arpan Sadhukhan and Frits Spieksma

Πηγή: SIAM Journal on Discrete Mathematics. 39:921-945

Θεματικοί όροι: FOS: Computer and information sciences, dynamic algorithms, Discrete Mathematics (cs.DM), Analysis of algorithms and problem complexity, General topics of discrete mathematics in relation to computer science, dominating set, stability, Approximation algorithms, bounded recourse, independent set, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, approximation algorithms, Dynamic algorithms, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2412.13358
https://zbmath.org/8037180
https://doi.org/10.1137/24m1644079
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.27

Mixed Precision HODLR Matrices: Mixed precision HODLR matrices

Συγγραφείς: Erin Carson, Xinye Chen, Xiaobo Liu

Συνεισφορές: Chen, Xinye

Πηγή: SIAM Journal on Scientific Computing. 47:A1408-A1435

Θεματικοί όροι: hierarchical matrices, Hierarchical matrices, 65D18, Roundoff error, mixed precision computing, Analysis of algorithms and problem complexity, 65G50, 65F55, 68Q25, 65D18, 68Q25, Numerical methods for low-rank matrix approximation, matrix compression, matrix computations AMS subject classifications. 65G50, Numerical Analysis (math.NA), [INFO] Computer Science [cs], Hierarchical matrices mixed precision computing matrix computations AMS subject classifications. 65G50 65F55 68Q25 65D18, Numerical aspects of computer graphics, image analysis, and computational geometry, FOS: Mathematics, Mathematics - Numerical Analysis, matrix computations, 65F55

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2407.21637
https://hal.science/hal-05066310v1
https://doi.org/10.1137/24m1683925
https://hal.science/hal-05066310v1/document

Decomposition of the option pricing formula for infinite activity jump-diffusion stochastic volatility models

Συγγραφείς: Youssef El-Khatib, Zororo S. Makumbe, Josep Vives

Πηγή: Mathematics and Computers in Simulation. 231:276-293

Θεματικοί όροι: option price decomposition, Lévy processes, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, variance gamma, Computer graphics, computational geometry (digital and algorithmic aspects), tempered stable, stochastic volatility

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/8031680
https://doi.org/10.1016/j.matcom.2024.12.010

Matchings, Relaxed Popularity, and Optimality: Matchings, relaxed popularity, and optimality

Συγγραφείς: Kavitha, Telikepalli

Πηγή: SIAM Journal on Discrete Mathematics. 39:881-911

Θεματικοί όροι: Combinatorial optimization, Matching models, stable matchings, bipartite graphs, mixed matchings, Analysis of algorithms and problem complexity, dual certificates

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/8037178
https://doi.org/10.1137/24m163596x

Ciphering the Modern World: A Comprehensive Analysis of DES, AES, RSA and DHKE

Συγγραφείς: Parikh, Prasann, Patel, Nishil, Patel, Dev, Modi, Pratham, Kaur, Hargeet

Πηγή: 2024 11th International Conference on Computing for Sustainable Global Development (INDIACom) Computing for Sustainable Global Development (INDIACom), 2024 11th International Conference on. :838-842 Feb, 2024

Relation: 2024 11th International Conference on Computing for Sustainable Global Development (INDIACom)

The Millennium Problem About Computational Intractability

Συγγραφείς: de Figueiredo, Celina^{Aff1, IDs4442502500003w_cor1}

Πηγή: Matemática Contemporânea: A publication from the Brazilian Mathematica Society. :1-9

Methodology of Algorithm Engineering

Συγγραφείς: Mendling, Jan, Leopold, Henrik, Meyerhenke, Henning, Depaire, Benoît

Πηγή: ACM Computing Surveys. 58(4):1-38

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3769071

On Uniqueness of Power Sum Decomposition: On uniqueness of power sum decomposition

Συγγραφείς: Taveira Blomenhofer, Alexander

Πηγή: SIAM Journal on Applied Algebra and Geometry. 9:211-234

Θεματικοί όροι: Computational real algebraic geometry, SDP, Waring decomposition, Estimation in multivariate analysis, Analysis of algorithms and problem complexity, Multilinear algebra, tensor calculus, subspace learning, Gaussian mixtures

Περιγραφή αρχείου: application/xml

A Relaxed Vector Auxiliary Variable Algorithm for Unconstrained Optimization Problems: A relaxed vector auxiliary variable algorithm for unconstrained optimization problems

Συγγραφείς: Shiheng Zhang, Jiahao Zhang, Jie Shen, Guang Lin

Πηγή: SIAM Journal on Scientific Computing. 47:C126-C150

Θεματικοί όροι: Artificial intelligence, adaptive learning rate, machine learning, Analysis of algorithms, SAV, Nonconvex programming, global optimization, optimization, gradient descent

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/7988242
https://doi.org/10.1137/23m1611087

From Word-Representable Graphs to Altered Tverberg-Type Theorems: From word-representable graphs to altered Tverberg-type theorems

Συγγραφείς: Deborah Oliveros, Antonio J. Torres

Πηγή: Discrete & Computational Geometry. 73:293-309

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, nerve complexes, combinatorial convexity, Analysis of algorithms and problem complexity, Erdős-Szekeres theorems, Combinatorial aspects of simplicial complexes, Helly-type theorems and geometric transversal theory, 01 natural sciences, Tverberg theorem, FOS: Mathematics, Mathematics - Combinatorics, Computer Science - Computational Geometry, Combinatorics (math.CO), 0101 mathematics, \(k\)-word-representable graphs

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2111.10038
https://zbmath.org/7986098
https://doi.org/10.1007/s00454-025-00718-5

Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG

Συγγραφείς: Cáceres, Manuel, Mumey, Brendan, Husić, Edin, Rizzi, Romeo, Cairo, Massimo, Sahlin, Kristoffer, Tomescu, Alexandru I.

Πηγή: IEEE/ACM Transactions on Computational Biology & Bioinformatics. 19(6):3673-3684

Θεματικοί όροι: Graph algorithms, Network problems, Analysis of Algorithms and Problem Complexity, Biology and genetics, datalogi, Computer Science

Περιγραφή αρχείου: print

Σύνδεσμος πρόσβασης: https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-199751
https://doi.org/10.1109/tcbb.2021.3131203

Efficiency of Self-Adjusting Heaps

Συγγραφείς: Sinnamon, Corwin, Tarjan, Robert E.

Πηγή: ACM Transactions on Algorithms. 21(4):1-39

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3708989

Recognition Complexity of Subgraphs of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf {k}}$$\end{document}-Connected Planar Cubic Graphs

Συγγραφείς: Goetze, Miriam^{Aff1, IDs00453025013508_cor1}, Jungeblut, Paul, Ueckerdt, Torsten

Πηγή: Algorithmica. 88(1)

A Revision of CROSS Security: Proofs and Attacks for Multi-Round Fiat–Shamir Signatures

Συγγραφείς: Battagliola, Michele^{Aff1, IDs00009025028827_cor1}, Longo, Riccardo, Pintore, Federico, Signorini, Edoardo, Tognolini, Giovanni

Πηγή: Mediterranean Journal of Mathematics. 22(5)

Finding a b-matching that embeds the maximum number of edge pairs in a given set

Συγγραφείς: Buahong, Siraphob, Suppakitpaisarn, Vorapong^{Aff2, IDs10878025013053_cor1}, Sripratak, Piyashat

Πηγή: Journal of Combinatorial Optimization. 49(5)