Results 51 to 60 of about 1,383,780 (316)
Putting Context into Schema Matching [PDF]
, 2006 Attribute-level schema matching has proven to be an important first step in developing mappings for data exchange, integration, restructuring and schema evolution. In this paper we investigate contextual schema matching, in which selection conditions are
Elnahrawy, Eiman +3 more
core
Computational Geometry20 pages, 14 figures; preliminary version in EuroCG ...
Oswin Aichholzer +4 more
openaire +5 more sources
Organoids in pediatric cancer research
FEBS Letters, EarlyView.Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley +1 more source
Monotonicity and Nash implementation in matching markets with contracts [PDF]
, 2005 Haake C-J, Klaus B. Monotonicity and Nash implementation in matching markets with contracts. Working Papers. Institute of Mathematical Economics. Vol 372.
Klaus, B.E. +3 more
core +4 more sources
Calpain small subunit homodimerization is robust and calcium‐independent
FEBS Letters, EarlyView.Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy +4 more
wiley +1 more source
Radio Physics and Radio Astronomy, 2018 Purpose: The question of the influence of modes of excitation of disk monopole antennas of microstrip topology on the antenna general properties is considered.
S. A. Pogarsky +3 more
doaj +1 more source
Journal of Graph Algorithms and Applications, 2021 A matching is compatible to two or more labeled point sets of size $n$ with labels $\{1,\dots,n\}$ if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to two or more labeled point sets in general position in the plane.
Oswin Aichholzer +7 more
openaire +4 more sources
Diversity and complexity in neural organoids
FEBS Letters, EarlyView.Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source
Robust matching and its optimum.
, 2023 reservedCon la presente trattazione si ha innanzi tutto l’intento di esaminare il concetto di matching robusto, introdotto da Hassin e Rubinstein in [1] ed esplicabile con il seguente gioco di somma zero con strategia pura..
COBALCHIN, MARIAVITTORIA
core
Cost-effectiveness of algorithms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Discrete ...
Graham Farr
doaj +1 more source