254 search results - page 8 / 51 » Binary amiable Words |
ICDAR
2009
IEEE
13 years 8 months ago
2009
IEEE
Hausdorff distance (HD) and its modifications provides one of the best approaches for matching of binary images. This paper proposes a formalism generalizing almost all of these H...
SSPR
2004
Springer
14 years 4 months ago
2004
Springer
Mixture modelling is a hot area in pattern recognition. This paper focuses on the use of Bernoulli mixtures for binary data and, in particular, for binary images. More specificall...
MP
2002
13 years 10 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
SIAMCOMP
2002
13 years 10 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
DAM
2011
13 years 5 months ago
2011
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...