Results 91 to 100 of about 5,808,675 (298)

Fractal Graph Optimization Algorithms [PDF]

open access: yesProceedings of the 44th IEEE Conference on Decision and Control, 2006
We introduce methods of hierarchically decomposing three types of graph optimization problems: all-pairs shortest path, all-pairs maximum flow,and search. Each method uses a partition on the graph to create a high level problem and several lower level problems.
J.R. Riehl, J.P. Hespanha
openaire   +1 more source

Class IIa HDACs forced degradation allows resensitization of oxaliplatin‐resistant FBXW7‐mutated colorectal cancer

open access: yesMolecular Oncology, EarlyView.
HDAC4 is degraded by the E3 ligase FBXW7. In colorectal cancer, FBXW7 mutations prevent HDAC4 degradation, leading to oxaliplatin resistance. Forced degradation of HDAC4 using a PROTAC compound restores drug sensitivity by resetting the super‐enhancer landscape, reprogramming the epigenetic state of FBXW7‐mutated cells to resemble oxaliplatin ...
Vanessa Tolotto   +13 more
wiley   +1 more source

A Review of 2D Lidar SLAM Research

open access: yesRemote Sensing
Two-dimensional (2D) simultaneous localization and mapping (SLAM) is a key technology for intelligent indoor robots. By using a map generated via SLAM, the robot can navigate and perform specific tasks.
Yingying Ran   +3 more
doaj   +1 more source

LDSO: Direct Sparse Odometry with Loop Closure

open access: yes, 2018
In this paper we present an extension of Direct Sparse Odometry (DSO) to a monocular visual SLAM system with loop closure detection and pose-graph optimization (LDSO).
Cremers, Daniel   +3 more
core   +1 more source

Entropic Optimal Transport on Random Graphs

open access: yesSIAM Journal on Mathematics of Data Science, 2023
In graph analysis, a classic task consists in computing similarity measures between (groups of) nodes. In latent space random graphs, nodes are associated to unknown latent variables. One may then seek to compute distances directly in the latent space, using only the graph structure.
openaire   +4 more sources

In vitro models of cancer‐associated fibroblast heterogeneity uncover subtype‐specific effects of CRISPR perturbations

open access: yesMolecular Oncology, EarlyView.
Development of therapies targeting cancer‐associated fibroblasts (CAFs) necessitates preclinical model systems that faithfully represent CAF–tumor biology. We established an in vitro coculture system of patient‐derived pancreatic CAFs and tumor cell lines and demonstrated its recapitulation of primary CAF–tumor biology with single‐cell transcriptomics ...
Elysia Saputra   +10 more
wiley   +1 more source

Molecular characterisation of human penile carcinoma and generation of paired epithelial primary cell lines

open access: yesMolecular Oncology, EarlyView.
Generation of two normal and tumour (cancerous) paired human cell lines using an established tissue culture technique and their characterisation is described. Cell lines were characterised at cellular, protein, chromosome and gene expression levels and for HPV status.
Simon Broad   +12 more
wiley   +1 more source

A Fusion Positioning System Based on Camera and LiDAR for Unmanned Rollers in Tunnel Construction

open access: yesSensors
As an important vehicle in road construction, the unmanned roller is rapidly advancing in its autonomous compaction capabilities. To overcome the challenges of GNSS positioning failure during tunnel construction and diminished visual positioning accuracy
Hao Huang, Yongbiao Hu, Xuebin Wang
doaj   +1 more source

SIMSF: A Scale Insensitive Multi-Sensor Fusion Framework for Unmanned Aerial Vehicles Based on Graph Optimization

open access: yesIEEE Access, 2020
Given the payload limitation of unmanned aerial vehicles (UAVs), lightweight sensors such as camera, inertial measurement unit (IMU), and GPS, are ideal onboard measurement devices.
Bo Dai   +5 more
doaj   +1 more source

A linear optimization technique for graph pebbling [PDF]

open access: yes, 2011
Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the ...
Hurlbert, Glenn
core  

Home - About - Disclaimer - Privacy