New research from the University of Waterloo is making inroads on one of the biggest problems in theoretical computer science ...
Abstract: We present CLIPPER+, an algorithm for finding maximal cliques in unweighted graphs for outlier-robust global registration. The registration problem can be formulated as a graph and solved by ...
Abstract: Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce positive effect with the minimal cost on a social network. The purpose of this article is to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback