Unbalanced OV

Let $0 < \alpha \leq 1$ . UOV is the OV problem with the specifications that $A$ is of size $n$ and $B$ is of size $m=\Theta(n^\alpha)$ and $d\leq n^{o(1)}$ .

Parameters

$n$ : size of $A$
$m$ : size of $B$
$d$ : dimensionality of vectors

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 3 of 3 reductions


Unbalanced OV	Dynamic Time Warping	2015
Unbalanced OV	Longest Common Subsequence	2015
OV	Unbalanced OV

Other relevant algorithms