Adaptive Task Planning for Long-Horizon Robotic Manipulation Based on Video Priors and Dynamic Scene Graphs. [PDF]
Ma G, Guo J, Tang X, Zhou H, Rong Y.
europepmc +1 more source
Mesenchymal stem cell-derived extracellular vesicles ameliorate heat stroke-induced hippocampal injury and modulate VIM-AS1-associated miR-34a-5p/Per2 signaling. [PDF]
Wang L +10 more
europepmc +1 more source
Integrating deep learning and pangenomics to recover missing heritability from wild structural variations. [PDF]
Wang Y, Cai M, Ma Y, Tellier A, Wei K.
europepmc +1 more source
Structure-conditioned self-supervised learning of residue interaction constraints in protein kinases for variant interpretation. [PDF]
Fadaei S, Krebs FS, Zoete V.
europepmc +1 more source
Correction to: gLeiden: accelerated community detection algorithms using directed and undirected graphs on GPUs. [PDF]
europepmc +1 more source
Related searches:
Specifying Knowledge Graph with Data Graph, Information Graph, Knowledge Graph, and Wisdom Graph
International Journal of Software Innovation, 2018Knowledge graphs have been widely adopted, in large part owing to their schema-less nature. It enables knowledge graphs to grow seamlessly and allows for new relationships and entities as needed. A knowledge graph is a graph constructed by representing each item, entity and user as nodes, and linking those nodes that interact with each other via edges.
Yucong Duan, Lixu Shao, Gongzhu Hu
openaire +1 more source
Graph Decomposition of Slim Graphs
Graphs and Combinatorics, 1999Let \(H\) be a fixed graph. An \(H\)-decomposition of an input graph \(G\) is a partition of the edge set of \(G\) such that each part forms a subgraph isomorphic to \(H\). This problem is known to be NP-complete as soon as \(H\) has a component with at least three edges. (This was conjectured by Holyer, and proved independently by \textit{D. Dor} and \
Yair Caro, Raphael Yuster
openaire +3 more sources

