and others., 2019] Sun Y

[Li W · 2019

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

quant-ph · 2025-05-29 · reject · novelty 3.0

Granular-ball compression plus quantum swap-test similarity checks is claimed to give a kNN search time logarithmic in the number of granular balls.

Showing 1 of 1 citing paper.

Efficient Quantum Approximate $k$NN Algorithm via Granular-Ball Computing quant-ph · 2025-05-29 · reject · none · ref 12
Granular-ball compression plus quantum swap-test similarity checks is claimed to give a kNN search time logarithmic in the number of granular balls.