Abstract: Give a finite undirected graph G = (V, E) and a positive integer κ ≥ 1, a distance-k matching is an edge set D ⊂ E that the pairwise distance of edges in D is at least k in G. The famous ...
Abstract: Occlusion is a common difficulty in application of multimodal image matching, which is essential for navigation and computer vision. However, recent multimodal image matching algorithms ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results