Results 21 to 30 of about 988,365 (280)
Dynamic Rank-Maximal Matchings [PDF]
, 2017 We consider the problem of matching applicants to posts where applicants have preferences over posts. Thus the input to our problem is a bipartite graph G = (A U P,E), where A denotes a set of applicants, P is a set of posts, and there are ranks on edges which denote the preferences of applicants over posts.
Prajakta Nimbhorkar +1 more
openaire +2 more sources
2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2016 In computer vision, many problems can be formulated as finding a low rank approximation of a given matrix. Ideally, if all elements of the measurement matrix are available, this is easily solved in the L2-norm using factorization. However, in practice this is rarely the case. Lately, this problem has been addressed using different approaches, one is to
Bylow, Erik +3 more
openaire +3 more sources
The Maximal Rank Conjecture for sections of curves [PDF]
Journal of Algebra, 2020 Let be a general curve of genus g embedded via a general linear series of degree d in P^r. The well-known Maximal Rank Conjecture asserts that the restriction maps H^0(O_{P^r}(m)) \to H^0(O_C(m) are of maximal rank; if known, this conjecture would determine the Hilbert function of C.
openaire +2 more sources
Topological mixing properties of rank‐one subshifts
Transactions of the London Mathematical Society, 2019 We study topological mixing properties and the maximal equicontinuous factor of rank‐one subshifts as topological dynamical systems. We show that the maximal equicontinuous factor of a rank‐one subshift is finite. We also determine all the finite factors
Su Gao, Caleb Ziegler
doaj +1 more source
The Rank-One property for free Frobenius extensions
Comptes Rendus. Mathématique, 2023 A conjecture by the second author, proven by Bonnafé–Rouquier, says that the multiplicity matrix for baby Verma modules over the restricted rational Cherednik algebra has rank one over $\mathbb{Q}$ when restricted to each block of the algebra.In this ...
Bellamy, Gwyn, Thiel, Ulrich
doaj +1 more source
The maximal rank of elliptic Delsarte surfaces [PDF]
Mathematics of Computation, 2011 Shioda described a method to compute the Lefschetz number of a Delsarte surface. In one of his examples he uses this method to compute the rank of an elliptic curve over k (
openaire +4 more sources
Deviation maximization for rank-revealing QR factorizations
Numerical Algorithms, 2022 AbstractIn this paper, we introduce a new column selection strategy, named here “Deviation Maximization”, and apply it to compute rank-revealing QR factorizations as an alternative to the well-known block version of the QR factorization with the column pivoting method, called QP3 and currently implemented in LAPACK’s routine.
Monica Dessole, Fabio Marcuzzi
openaire +4 more sources
PLoS ONE, 2021 The importance of maximal resection in the treatment of glioblastoma (GBM) has been reported in many studies, but maximal resection of thalamic GBM is rarely attempted due to high rate of morbidity and mortality.
Jaejoon Lim +6 more
doaj +1 more source
Спортивная медицина: наука и практика, 2023 Objective: to estimate the functional features of the cardiorespiratory system of female cross-country skiers with different skills levels at the maximal bicycle ergometer test.Material and methods: 70 female cross-country skiers were divided into three ...
I. O. Garnov +2 more
doaj +1 more source
A Dichotomy Theorem for Ordinal Ranks in MSO [PDF]
Logical Methods in Computer ScienceWe focus on formulae $\exists X.\, φ(\vec{Y}, X)$ of monadic second-order logic over the full binary tree, such that the witness $X$ is a well-founded set.
Damian Niwiński +2 more
doaj +1 more source