Results 81 to 90 of about 12,413 (296)

Color Invariant Edge Detection [PDF]

open access: yes, 1999
Segmentation based on color, instead of intensity only, pro- vides an easier distinction between materials, on the condition that ro- bustness against irrelevant parameters is achieved, such as illumination source, shadows, geometry and camera sensitivities.
Geusebroek, J.-M.   +5 more
openaire   +2 more sources

Edge coloring of a graph [PDF]

open access: yes, 2004
Thesis (Master)--Izmir Institute of Technology, Mathematics, Izmir, 2004Includes bibliographical references (leaves: 35-36)Text in English; Abstract: Turkish and Englishviii, 36 leavesThe edge coloring problem is one of the fundamental problem on graphs ...
Beşeri, Tina
core   +1 more source

Network divergence analysis identifies adaptive gene modules and two orthogonal vulnerability axes in pancreatic cancer

open access: yesMolecular Oncology, EarlyView.
Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson   +9 more
wiley   +1 more source

Engineered extracellular vesicles enriched with the miR‐214/199a cluster enhance the efficacy of chemotherapy in ovarian cancer

open access: yesMolecular Oncology, EarlyView.
Loss of the miR‐214/199a cluster is associated with recurrence in ovarian cancer. Engineered small extracellular vesicles (m214‐sEVs) elevate miR‐214‐3p/miR‐199a‐5p in tumor cells, suppress β‐catenin, TLR4, and YKT6 signaling, reprogram tumor‐derived sEV cargo, reduce chemoresistance and migration, and enhance carboplatin efficacy and survival in ...
Weida Wang   +12 more
wiley   +1 more source

Deterministic Online Bipartite Edge Coloring

open access: yes
We study online bipartite edge coloring, with nodes on one side of the graph revealed sequentially. The trivial greedy algorithm is (2 — o (1))-competitive, which is optimal for graphs of low maximum degree, Δ = O (log n) [BNMN IPL’92].
Vintan, Radu   +7 more
core   +1 more source

Somatic mutational landscape in von Hippel–Lindau familial hemangioblastoma

open access: yesMolecular Oncology, EarlyView.
The causes of central nervous system (CNS) hemangioblastoma in Von Hippel–Lindau (vHL) disease are unclear. We used Whole Exome Sequencing (WES) on familial hemangioblastoma to investigate events that underlie tumor development. Our findings suggest that VHL loss creates a permissive environment for tumor formation, while additional alterations ...
Maja Dembic   +5 more
wiley   +1 more source

Twin edge colorings of certain square graphs and product graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2016
A twin edge $k\!$-coloring of a graph $G$ is a proper edge $k$-coloring of $G$ with the elements of $\mathbb{Z}_k$ so that the induced vertex $k$-coloring, in which the color of a vertex $v$ in $G$ is the sum in $\mathbb{Z}_k$ of the colors of the edges ...
R Rajarajachozhan, R. Sampathkumar
doaj   +1 more source

Heterozygous loss‐of‐function alleles associate the conserved 3′‐5′ exoribonuclease EXOSC10 with hypersensitivity to the anticancer drug 5‐fluorouracil

open access: yesMolecular Oncology, EarlyView.
EXOSC10, an essential nuclear RNA exosome‐associated 3′‐5′ exoribonuclease, is inhibited by the anticancer drug 5‐fluorouracil (5‐FU), and EXOSC10 depletion increases 5‐FU sensitivity. The colon‐cancer variant EXOSC10S402T, located in a proteolysis motif, is stable and nuclear but nonfunctional in vivo.
Radhika Sain   +10 more
wiley   +1 more source

Researches on the coloring of multigraphs

open access: yes
Given a loopless multigraph $G$ and a vertex-function $f\ : \ V(G) \rightarrow \mathbb{N}\backslash \{0\}$, an {\bf $f$-(edge)-coloring} of $G$ is an assignment of colors to the edges of $G$ such that each color appears at each vertex $v\in V(G)$ at most
Hao, Yanli
core   +1 more source

Injective edge coloring of graphs [PDF]

open access: yes, 2019
Three edges $e_{1}, e_{2}$ and $e_{3}$ in a graph $G$ are consecutive if they form a path (in this order) or a cycle of lengths three. An injective edge coloring of a graph $G = (V,E)$ is a coloring $c$ of the edges of $G$ such that if $e_{1}, e_{2}$ and
Cardoso, Domingos M.   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy