101 search results - page 19 / 21 » The Intractability of Computing the Hamming Distance |
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
IJSR
2010
13 years 4 months ago
2010
Abstract— People in densely populated environments typically form groups that split and merge. In this paper we track groups of people so as to reflect this formation process an...
APPROX
2009
Springer
14 years 10 days ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
SSDBM
2010
IEEE
13 years 10 months ago
2010
IEEE
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
BIRD
2008
Springer
13 years 7 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...