GitHub

Euclidean and Mutual Reachability Minimum Spanning Trees

Euclidean Minimum Spanning Trees using single-, sesqui-, and dual-tree Borůvka algorithms, which are quite fast in spaces of low intrinsic dimensionality, minimum spanning trees with respect to mutual ...
Frontiers

Genomic infrastructure for cetacean research and conservation: reference genomes for eight families spanning the cetacean tree of life

Reference genomes from representative species across families provide the critical infrastructure for research and conservation. The Cetacean Genomes Project (CGP) began in early 2020 to facilitate ...
Frontiers

AlignScape, displaying sequence similarity using self-organizing maps

The current richness of sequence data needs efficient methodologies to display and analyze the complexity of the information in a compact and readable manner. Traditionally, phylogenetic trees and ...
Boston College

Master of Science (M.S.) in Applied Analytics

Leverage the power of data analysis, machine learning, and artificial intelligence with a specialized master’s degree in one of today’s most in-demand fields. Taught by experienced professionals, this ...
GitHub

Tree Energy Loss: Towards Sparsely Annotated Semantic Segmentation

This repository is an official implementation of the CVPR 2022 paper Tree Energy Loss: Towards Sparsely Annotated Semantic Segmentation. Abstract. Sparsely annotated semantic segmentation (SASS) aims ...