Results 81 to 90 of about 39,682 (219)
The Temperley–Lieb tower and the Weyl algebra
Journal of the London Mathematical Society, Volume 111, Issue 5, May 2025.Abstract We define a monoidal category W${\mathbf {W}}$ and a closely related 2‐category 2Weyl${\mathbf {2Weyl}}$ using diagrammatic methods. We show that 2Weyl${\mathbf {2Weyl}}$ acts on the category TL:=⨁nTLn−mod$\mathbf {TL}:=\bigoplus _n \operatorname{TL}_n\mathrm{-mod}$ of modules over Temperley–Lieb algebras, with its generating 1‐morphisms ...
Matthew Harper, Peter Samuelson
wiley +1 more source
Machine Learning‐Enabled Drug‐Induced Toxicity Prediction
Advanced Science, Volume 12, Issue 16, April 24, 2025.Unexpected toxicity accounts for 30% of drug development failures. This review highlights ML innovations in predicting drug‐induced toxicity, emphasizing comparative analyses, interpretable algorithms, and multi‐source data integration. It categorizes toxicity types, summarizes ML models, and organizes key databases, offering strategies to address ...
Changsen Bai +5 more
wiley +1 more source
A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs [PDF]
, 2015 Cyber security is one of the most significant technical challenges in current times. Detecting adversarial activities, prevention of theft of intellectual properties and customer data is a high priority for corporations and government agencies around the
Agarwal, Khushbu +4 more
core
Fast Search for Dynamic Multi-Relational Graphs
, 2013 Acting on time-critical events by processing ever growing social media or news streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs.
Chin, George +3 more
core +1 more source
Webb's conjecture and generalised Harish‐Chandra theory
Bulletin of the London Mathematical Society, Volume 57, Issue 4, Page 1083-1092, April 2025.Abstract Webb's conjecture states that the orbit space of the Brown complex of a finite group at any given prime ℓ$\ell$ is contractible. This conjecture was proved by Symonds in 1998. In this paper, we suggest a generalisation of Webb's conjecture for finite reductive groups.
Damiano Rossi
wiley +1 more source
Matched Filters for Noisy Induced Subgraph Detection [PDF]
, 2018 The problem of finding the vertex correspondence between two noisy graphs with different number of vertices where the smaller graph is still large has many applications in social networks, neuroscience, and computer vision.
Lyzinski, Vince +3 more
core
A Necessary and Sufficient Condition for Graph Matching to be equivalent to Clique Search [PDF]
, 2009 This paper formulates a necessary and sufficient condition for a generic graph matching problem to be equivalent to the maximum vertex and edge weight clique problem in a derived association graph.
Jain, Brijnesh
core
SICode: Embedding-Based Subgraph Isomorphism Identification for Bug Detection
IEEE International Conference on Program ComprehensionGiven a known buggy code snippet, searching for similar patterns in a target project to detect unknown bugs is a reasonable approach. In practice, a search unit, such as a function, may appear quite different from the buggy snippet but actually contains ...
Yuanjun Gong +6 more
semanticscholar +1 more source
Journal of King Saud University: Computer and Information Sciences, 2019 In a distributed environment, the volume of graph database increases quickly because graphs emerge from several autonomous sources. Sub-graph query processing is a challenging problem in distributed environment.
Shaik Fathimabi +2 more
doaj
A Polynomial Algorithm for Subisomorphism of Open Plane Graphs
, 2009 International audienceWe address the problem of searching for a pattern in a plane graph, that is, a planar drawing of a planar graph. We define plane subgraph isomorphism and give a polynomial algorithm for this problem.
Damiand, Guillaume +4 more
core +1 more source