Past year
All results
- All results
- Verbatim
Aug 5, 2024 · Stefan Hoffmann: Binary and circular automata having maximal state complexity for the set of synchronizing words. Inf. Comput. 295(Part B): 105076 (2023)
Apr 22, 2024 · In § 2 we present algorithms for detecting synchronizability; we also discuss the computational complexity of the main prob- lems related to synchronizability.
Apr 12, 2024 · We propose the Quadratic Synchronization Rule (QSR) to simultaneously reduce the wall-clock time and improve the final test accuracy of local gradient methods.
Oct 20, 2023 · We present the first GPU-native sparse direct solver that can execute on both AMD and NVIDIA GPUs. We demonstrate significant performance improvements.
Sep 23, 2024 · Abstract—This paper addresses the optimization of edge- weighted networks by maximizing algebraic connectivity to enhance network robustness.
Dec 23, 2023 · However, in contrast to the classical sparse recovery problem, the most natural formulation for finding the sparsest vector in a subspace is usually nonconvex.
Nov 22, 2023 · This paper proposes a nice extension of standard unstructured, iterative neural network pruning algorithms. Specifically, it involves training multiple copies ...
Oct 10, 2023 · The angular synchronization problem aims to accurately estimate (up to a constant additive phase) a set of unknown angles θ1,...,θn P r0, 2πq from m noisy ...
6 days ago · Currently, the sparsity of weights and activations are mainly utilized to improve the energy efficiency and computational performance of CNN accelerators.
Nov 29, 2023 · It enables the simulation and training of large-scale SNNs with significantly reduced computational costs, paving the way for the advancement of brain-inspired ...
Missing: Constraints. | Show results with:Constraints.