Cramér-Rao Lower Bounds for Hybrid Distance Estimation Schemes.
Stephan SandW. WangArmin DammannPublished in: VTC Fall (2012)
Keyphrases
- distance estimation
- lower bound
- upper bound
- np hard
- branch and bound algorithm
- branch and bound
- similarity search
- lower and upper bounds
- objective function
- optimal cost
- linear programming relaxation
- worst case
- nearest neighbor
- neural network
- dimensionality reduction
- high dimensional
- pattern recognition
- randomly generated problems