Results 81 to 90 of about 4,664 (221)
Graph Drawing Algorithm Engineering with AGD
, 2000 We discuss the algorithm engineering aspects of AGD, a software library of algorithms for graph drawing. AGD represents algorithms as classes that provide one or more methods for calling the algorithm.
Gutwenger, Carsten +4 more
core
The Challenge of Handling Structured Missingness in Integrated Data Sources
Advanced Intelligent Discovery, EarlyView.As data integration becomes ever more prevalent, a new research question that emerges is how to handle missing values that will inevitably arise in these large‐scale integrated databases? This missingness can be described as structured missingness, encompassing scenarios involving multivariate missingness mechanisms and deterministic, nonrandom ...
James Jackson +6 more
wiley +1 more source
Advanced Intelligent Discovery, EarlyView.This paper presents a computer vision (deep learning) pipeline integrating YOLOv8 and YOLOv9 for automated detection, segmentation, and analysis of rosette cellulose synthase complexes in freeze‐fracture electron microscopy images. The study explores curated dataset expansion for model improvement and highlights pipeline accuracy, speed ...
Siri Mudunuri +6 more
wiley +1 more source
A hybrid graph representation for exact graph algorithms
, 2018 Many exact search algorithms for NP-hard graph problems adopt the old Davis-Putman branch-and-reduce paradigm. The performance of these algorithms often suffers from the increasing number of graph modifications, such as vertex/edge deletions, that reduce
Abu-Khzam, Faisal N. +2 more
core
Advanced Intelligent Discovery, EarlyView.A machine learning‐guided self‐driving laboratory screened over 500 nickel‐based layered double‐hydroxide catalysts for alkaline oxygen evolution. Out of the eight metals, the robot uncovered a quaternary Ni–Fe–Cr–Co catalysts requiring only 231 mV overpotential to reach 20 mA cm−2.
Nis Fisker‐Bødker +3 more
wiley +1 more source
, 1992 A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to H can be obtained from G by a series of vertex deletions, edge deletions, and edge contractions.
McGuinness, Patrick James
core
Advanced Intelligent Discovery, EarlyView.Heat generation in lithium‐ion batteries affects performance, aging, and safety, requiring accurate thermal modeling. Traditional methods face efficiency and adaptability challenges. This article reviews machine learning‐based and hybrid modeling approaches, integrating data and physics to improve parameter estimation and temperature prediction ...
Qi Lin +4 more
wiley +1 more source
The induced path function, monotonicity and betweenness
The induced path function $J(u, v)$ of a graph consists of the set of all vertices lying on the induced paths between vertices $u$ and $v$. This function is a special instance of a transit function.
Changat, M., Mathew, J., Mulder, H.M.
core
ArchE: A Graph Drawing System for Archaeology
, 1997 We present ArchE (Archaeological Editor), a system for processing and displaying archaeological data. ArchE checks these data for consistency, simplifies and displays them; for each of these steps ArchE offers a number of different algorithms.
Hundack, Christoph +7 more
core +1 more source
Advanced Intelligent Discovery, EarlyView.This study reveals that sampling strategy (i.e., sampling size and approach) is a foundational prerequisite for building accurate and generalizable AI models in peptide discovery. Reaching a threshold of 7.5% of the total tetrapeptide sequence space was essential to ensure reliable predictions.
Meiru Yan +3 more
wiley +1 more source