101 search results - page 5 / 21 » The Intractability of Computing the Hamming Distance |
95
Voted
SODA
2000
ACM
14 years 11 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
97
Voted
WABI
2010
Springer
14 years 7 months ago
2010
Springer
The center string (or closest string) problem is a classical computer science problem with important applications in computational biology. Given k input strings and a distance thr...
DCC
2001
IEEE
15 years 9 months ago
2001
IEEE
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
We develop a multi-class object detection framework whose core component is a nearest neighbor search over object part classes. The performance of the overall system is critically...
NIPS
2008
14 years 11 months ago
2008
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...