Results 201 to 210 of about 58,186 (254)

Local equivalence and refinements of Rasmussen's s‐invariant

Journal of Topology, Volume 19, Issue 1, March 2026.
Abstract Inspired by the notions of local equivalence in monopole and Heegaard Floer homology, we introduce a version of local equivalence that combines odd Khovanov homology with equivariant even Khovanov homology into an algebraic package called a local even–odd (LEO) triple.
Nathan M. Dunfield, Robert Lipshitz, Dirk Schütz   +2 more
wiley   +1 more source

Reverse network diffusion to remove indirect noise for better inference of gene regulatory networks. [PDF]

Bioinformatics
Yu J, Leng J, Yuan F, Sun D, Wu LY.
europepmc   +1 more source

Arrow of Time in Quantum Mechanics and Set Theory. [PDF]

Entropy (Basel)
Król J.
europepmc   +1 more source

Exact and parameterized algorithms for choosability. [PDF]

Acta Inform
Bliznets I, Nederlof J.
europepmc   +1 more source

ActiveReach: an active learning framework for approximate reachability query answering in large-scale graphs. [PDF]

Front Big Data
Raghebi Z, Banaei-Kashani F.
europepmc   +1 more source

Transcranial direct current stimulation suggests a causal role of the medial prefrontal cortex in learning social hierarchy. [PDF]

Commun Biol
Qu C, Huang Y, Philippe R, Cai S, Derrington E, Moisan F, Shi M, Dreher JC.   +7 more
europepmc   +1 more source

The impact of vehicle lane-changing on the speed and delay of vehicles in the target lane based on the GMM-HMM. [PDF]

Sci Rep
Yang Q, Li P, Lv D, Hu G, Wang X.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Transition-Metal-Catalyzed Reductive Amination Employing Hydrogen

Chemical Reviews, 2020
The reductive amination, the reaction of an aldehyde or a ketone with ammonia or an amine in the presence of a reducing agent and often a catalyst, is an important amine synthesis and has been intensively investigated in academia and industry for a century.
Torsten Irrgang, Rhett Kempe
openaire   +2 more sources

Parallel transitive closure and transitive reduction algorithms

Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications, 2002
The authors provide distinct algorithms for computing transitive closure and transitive reduction with sequential time complexities of O( Sigma e/sub i/) and O(n/sup 2/+ Sigma e/sub i/), respectively, and parallel time complexities of O(e/sub i/) And O(n+e/sub i/), respectively.
P. Chang, L.J. Henschen
openaire   +1 more source

The Transitive Reduction of a Directed Graph

SIAM Journal on Computing, 1972
We consider economical representations for the path information in a directed graph. A directed graph $G^t $ is said to be a transitive reduction of the directed graph G provided that (i) $G^t $ has a directed path from vertex u to vertex v if and only if G has a directed path from vertex u to vertex v, and (ii) there is no graph with fewer arcs than ...
Aho, A. V., Garey, M. R., Ullman, J. D.
openaire   +2 more sources