Results 11 to 20 of about 3,587 (121)
EACR 2025 Congress: Innovative Cancer Science, 16-19 June 2025. [PDF]
Mol OncolAbstracts submitted to the ‘EACR 2025 Congress: Innovative Cancer Science’, from 16–19 June 2025 and accepted by the Congress Organising Committee are published in this Supplement of Molecular Oncology, an affiliated journal of the European Association for Cancer Research (EACR).
europepmc +2 more sources
Analysis of variance--why it is more important than ever [PDF]
, 2005 Analysis of variance (ANOVA) is an extremely important method in exploratory and confirmatory data analysis. Unfortunately, in complex problems (e.g., split-plot designs), it is not always easy to set up an appropriate ANOVA.
Hoijtink, Herbert, Hox, Joop
core +8 more sources
HOPs and COPs: Room frames with partitionable transversals [PDF]
, 2000 In this paper, we construct Room frames with partitionable transversals. Direct and recursive constructions are used to find sets of disjoint complete ordered partitionable (COP) transversals and sets of disjoint holey ordered partitionable (HOP ...
Dinitz, Jeffrey H., Lamken, Esther R.
core +1 more source
Estimates on the Size of Symbol Weight Codes [PDF]
, 2012 The study of codes for powerlines communication has garnered much interest over the past decade. Various types of codes such as permutation codes, frequency permutation arrays, and constant composition codes have been proposed over the years.
Han Mao Kiah +4 more
core +1 more source
The geometric reason for the non-existence of a MOL(6) [PDF]
, 2022 The problem of Euler concerning the 36 officers, (Euler, in Leonardi Euleri Opera Ser I 7:291–392, 1782), was first solved by Tarry (Comptes rendus Ass Franc Sci Nat 1 (1900) 2:170–203, 1901).
Betten, Dieter
core +1 more source
Disjoint Blocks in a MOL(6) [PDF]
, 2020 We prove that the maximal number of pairwise disjoint 4-blocks in a MOL(6) is 3. We recall various proofs for the non-existence of a MOL(6) and show: with the theorem the proofs can be simplified ...
Betten, Dieter
core +1 more source
Minimal Ramsey graphs, orthogonal Latin squares, and hyperplane coverings [PDF]
, 2022 This thesis consists of three independent parts. The first part of the thesis is concerned with Ramsey theory. Given an integer $q\geq 2$, a graph $G$ is said to be \emph{$q$-Ramsey} for another graph $H$ if in any $q$-edge-coloring of $G$ there ...
Boyadzhiyska, Simona
core +1 more source
Traditional and new principles of perceptual grouping [PDF]
, 2014 Perceptual grouping refers to the process of determining which regions and parts of the visual scene belong together as parts of higher order perceptual units such as objects or patterns.
Brooks, Joseph L
core +1 more source
Generalized covering designs and clique coverings
, 2011 Inspired by the "generalized t-designs" defined by Cameron [P. J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835--4842], we define a new class of combinatorial designs which simultaneously provide a generalization of both ...
Bailey, Robert F. +3 more
core +2 more sources