We study the problem of estimating the size of a maximum matching in sublinear time. The problem has been studied extensively in the literature and various algorithms and lower bounds are known for it ...
Abstract: Although traditional structural controllability theory successfully determines the number and selection of driver nodes for complete network control in linear time-invariant systems, many ...
Abstract: Point set registration is a core problem in 3D vision and robotics. However, in complex scenarios such as low overlap, noise interference, and scale variations, traditional ICP algorithms ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback