Login / Signup
Upperbounds on the probability of finding marked connected components using quantum walks.
Adam Glos
Nikolajs Nahimovs
Konstantin Balakirev
Kamil Khadiev
Published in:
CoRR (2019)
Keyphrases
</>
connected components
binary images
quantum computation
level set
graph mining
grey levels
data sets
mathematical morphology
connected component analysis