Results 31 to 40 of about 2,400,349 (361)
Tiling is a well-known pattern mining technique. Traditionally, it discovers large areas of ones in binary databases or matrices, where an area is defined by a set of rows and a set of columns. In this paper, we introduce the novel problem of ranked tiling, which is concerned with finding interesting areas in ranked data. In this data, each transaction
Le Van, Thanh +5 more
openaire +2 more sources
Pacing and Positioning Strategies During an Elite Fixed-Gear Cycling Criterium
Fixed-gear cycling performance during criteriums predominantly involves the aerobic system. Whether pacing is another important factor for performance is unknown.
Nicolas Babault +4 more
doaj +1 more source
Inhibition of RANK signaling as a potential immunotherapy in breast cancer
RANK signaling in mouse mammary tumor cells exerts an immunosuppressive environment by promoting the infiltration of pro-tumorigenic neutrophils and preventing CD8 T cell recruitment.
C Gómez-Aleza, E González-Suárez
doaj +1 more source
On the Ranks and Border Ranks of Symmetric Tensors [PDF]
v1: 22 pages; v2: 23 pages, numerous small improvements; v3: final version, accepted for publication in Found.
J. M. Landsberg, Zach Teitler
openaire +3 more sources
$p$-groups with maximal elementary abelian subgroups of rank $2$ [PDF]
Let p be an odd prime number and G a finite p-group. We prove that if the rank of G is greater than p, then G has no maximal elementary abelian subgroup of rank 2.
Mazza, Nadia +3 more
core +1 more source
BI-LIPSCHITZ CONTACT INVARIANCE OF RANK
We address the question of whether the Thom-Boardman symbol of a map germ is an invariant with respect to bi-Lipschitz right equivalence. We give a counterexample showing that in general the answer is negative.
Xuan Viet Nhan Nguyen
doaj +1 more source
Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview [PDF]
Substantial progress has been made recently on developing provably accurate and efficient algorithms for low-rank matrix factorization via nonconvex optimization.
Yuejie Chi, Yue M. Lu, Yuxin Chen
semanticscholar +1 more source
AbstractWe show that for each computable ordinal $\alpha > 0$ it is possible to find in each Martin-Löf random ${\rm{\Delta }}_2^0 $ degree a sequence R of Cantor-Bendixson rank α, while ensuring that the sequences that inductively witness R’s rank are all Martin-Löf random with respect to a single countably supported and computable measure.
Rupert Hölzl 0001 +1 more
openaire +3 more sources
On Ranking Consistency of Pre-ranking Stage
9 pagees, 5 ...
Gu, Siyu, Sheng, Xiangrong
openaire +2 more sources
Shamanism as a research subject: some methodological viewpoints
There is hardly any other ethnological or historico-religious subject that has had such a great power of attraction on scholars or on other more or less popular writers as shamanism, particularly in its North-Eurasian version, the one dealt with in this ...
Gustav Ränk
doaj +1 more source

