OPTICS
The R*-tree: an efficient and robust access method for points and rectangles
A cost model for nearest neighbor search in high-dimensional data space
Optimal multi-step k-nearest neighbor search
Proceedings of the 1990 ACM SIGMOD international conference on Management of data - SIGMOD ’90
Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS ’97
Proceedings of the 1999 ACM SIGMOD international conference on Management of data - SIGMOD ’99
Proceedings of the 1998 ACM SIGMOD international conference on Management of data - SIGMOD ’98
Daniel A. Keim
Christian Böhm
Jörg Sander
Stefan Berchtold
Markus M. Breunig
Mihael Ankerst
Dimensionality reduction and similarity computation by inner product approximations
Structured Streaming Skeleton – A New Feature for Online Human Gesture Recognition