Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper.
Query: Two Strategies to Speed up Connected Component Labeling Algorithms
parallel image component labeling with watershed transformation .
Parallel k-Means Image Segmentation Using Sort, Scan and Connected Components on a GPU
Topology Cuts: A Novel Min-Cut/Max-Flow Algorithm for Topology Preserving Segmentation in N-D Images
Image Segmentation and Region Growing Algorithm
On Identifying Strongly Connected Components in Parallel
Visual analysis of graphs with multiple connected components
A contour processing method for fast binary neighbourhood operations
Image Segmentation by Size-Dependent Single Linkage Clustering of a Watershed Basin Graph
Image Segmentation by Cascaded Region Agglomeration
Image segmentation using seeded region growing
Community Detection Using A Neighborhood Strength Driven Label Propagation Algorithm
A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm
Median evidential c-means algorithm and its application to community detection
A semi-synchronous label propagation algorithm with constraints for community detection in complex networks
Graph cut based image segmentation with connectivity priors
A fast divisive community detection algorithm based on edge degree betweenness centrality
Computing strongly connected components in a linear number of symbolic steps
Recursive X-Y cut using bounding boxes of connected components
Image segmentation using
LabelRank: A Stabilized Label Propagation Algorithm for Community Detection in Networks
MARSA: A Marketplace for Realtime Human Sensing Data
Introduction to Algorithms
Dynamic trot-walking with the hydraulic quadruped robot — HyQ: Analytical trajectory generation and active compliance control
Identifying Argumentation Schemes in Genetics Research Articles
Domain Adaptive Faster R-CNN for Object Detection in the Wild