Zobrazeno 1 - 10
of 4 224
pro vyhledávání: '"Kanj A"'
This paper presents Sparse Gradient Descent as a solution for variable selection in convex piecewise linear regression where the model is given as $\mathrm{max}\langle a_j^\star, x \rangle + b_j^\star$ for $j = 1,\dots,k$ where $x \in \mathbb R^d$ is
Externí odkaz:
http://arxiv.org/abs/2411.02225
Rotating magnets have recently emerged as an efficient method for producing ultra-low frequency signals for through-earth and through-seawater communications. Magneto-mechanical resonator (MMR) arrays, which are magnetized torsional rotors with a res
Externí odkaz:
http://arxiv.org/abs/2410.14855
Autor:
Kanj, A. El, Mantion, S., Boventer, I., Bortolotti, P., Cros, V., Anane, A., Gomonay, O., Lebrun, R.
We investigate spin-rectification phenomena in canted antiferromagnets, closely connected to the family of altermagnetic materials. Our results show that excitation efficiency is significantly enhanced by the Dzyaloshinskii-Moriya interaction. Antife
Externí odkaz:
http://arxiv.org/abs/2410.08013
Several works have recently investigated the parameterized complexity of data completion problems, motivated by their applications in machine learning, and clustering in particular. Interestingly, these problems can be equivalently formulated as clas
Externí odkaz:
http://arxiv.org/abs/2407.10699
We study the parameterized complexity of a generalization of the coordinated motion planning problem on graphs, where the goal is to route a specified subset of a given set of $k$ robots to their destinations with the aim of minimizing the total ener
Externí odkaz:
http://arxiv.org/abs/2404.15950
Autor:
Kanj, Iyad, Parsa, Salman
We study computationally-hard fundamental motion planning problems where the goal is to translate $k$ axis-aligned rectangular robots from their initial positions to their final positions without collision, and with the minimum number of translation
Externí odkaz:
http://arxiv.org/abs/2402.17846
We study two variants of the fundamental problem of finding a cluster in incomplete data. In the problems under consideration, we are given a multiset of incomplete $d$-dimensional vectors over the binary domain and integers $k$ and $r$, and the goal
Externí odkaz:
http://arxiv.org/abs/2312.07628
In Coordinated Motion Planning (CMP), we are given a rectangular-grid on which $k$ robots occupy $k$ distinct starting gridpoints and need to reach $k$ distinct destination gridpoints. In each time step, any robot may move to a neighboring gridpoint
Externí odkaz:
http://arxiv.org/abs/2312.07144
Hypersphere classification is a classical and foundational method that can provide easy-to-process explanations for the classification of real-valued and binary data. However, obtaining an (ideally concise) explanation via hypersphere classification
Externí odkaz:
http://arxiv.org/abs/2312.07103
We present streaming algorithms for the graph $k$-matching problem in both the insert-only and dynamic models. Our algorithms, with space complexity matching the best upper bounds, have optimal or near-optimal update time, significantly improving on
Externí odkaz:
http://arxiv.org/abs/2310.10815