101 search results - page 16 / 21 » The Intractability of Computing the Hamming Distance |
EMMCVPR
1997
Springer
13 years 11 months ago
1997
Springer
Consistent labelling problems frequently have more than one solution. Most work in the "eld has aimed at disambiguating early in the interpretation process, using only local ...
SDMW
2010
Springer
13 years 6 months ago
2010
Springer
In an outsourced database framework, clients place data management with specialized service providers. Of essential concern in such frameworks is data privacy. Potential clients ar...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
SPIRE
2009
Springer
14 years 2 days ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...