Abstract: Feature selection plays an important role in data analysis, yet traditional graph-based methods often produce suboptimal results. These methods typically follow a two-stage process: ...
docker build -f CPU.Dockerfile -t satgnn . (swap CPU. for GPU. if on NVIDIA GPUs) Problem: Managing mega-constellations (e.g., Starlink, OneWeb) involves optimizing communication paths, maintaining ...
Abstract: The number of (full) binary trees with n internal vertices is famously the Catalan number (2n)!/(n!(n+1!). Twenty years ago, Dr. Werner Krandick published a combinatorial gem investigating ...
The SIAM Annual Meeting provides a broad view of the state of the art in applied mathematics, computational and data science, and their applications through invited presentations, prize lectures, ...
Discrete choice problems with complementarities among options quickly grow infeasible to solve, since they generically require evaluating all combinations of choices. We develop a solution method that ...
Abstract: The prevalence of graph data has brought a lot of attention to cohesive and dense subgraph mining. In contrast with the large number of indexes proposed to help mine dense subgraphs in ...
Data acquisition was done using web crawling techniques on several databases and related research results. These data were used to build three pharmacological networks as follows. 2) Network B is an ...
The DOE SC program in Advanced Scientific Computing Research (ASCR) hereby announces its interest in basic research in the design, development, analysis, and scalability of randomized algorithms for ...
Different graph types might differ in group comparison due to differences in underlying graph schemas. Thus, this study examined whether graph schemas are based on perceptual features (i.e., each ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback