10 papers:
SIGMOD-2015-GuoCC #algorithm #keyword #performance #query- Efficient Algorithms for Answering the m-Closest Keywords Query (TG, XC, GC), pp. 405–418.
STOC-2012-KhotPV #preprocessor #problem- 2log1-ε n hardness for the closest vector problem with preprocessing (SK, PP, NKV), pp. 277–288.
ICALP-2007-BlomerN- Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima (JB, SN), pp. 65–77.
- ICALP-2004-IndykLLP #problem
- Closest Pair Problems in Very High Dimensions (PI, ML, OL, EP), pp. 782–792.
ICPR-v1-2004-ZhangJT- Geodesic Closest Point Constrained Inter-Subject Non-Rigid Registration (ZZ, YJ, HTT), pp. 564–567.
- ICPR-v3-2002-ChetverikovSSK #algorithm
- The Trimmed Iterative Closest Point Algorithm (DC, DS, DS, PK), pp. 545–548.
VLDB-2001-ManolopoulosT #clustering #named- C2P: Clustering based on Closest Pairs (AN, YT, YM), pp. 331–340.
TOOLS-USA-2001-McClure #how #privacy #security- Hacking = Privacy: How Computer Hacking Can Shore Up Your Defenses and Deliver the Closest Ideal to Security Available (SM), p. 7.
- SIGMOD-2000-CorralMTV #database #query
- Closest Pair Queries in Spatial Databases (AC, YM, YT, MV), pp. 189–200.
- ICALP-2000-Blomer
- Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices (JB), pp. 248–259.
