254 search results - page 21 / 51 » Binary amiable Words |
COMBINATORICS
2007
14 years 11 months ago
2007
We consider the finite binary words Z(n), n ∈ N, defined by the following selfsimilar process: Z(0) := 0, Z(1) := 01, and Z(n + 1) := Z(n) · Z(n − 1), where the dot · deno...
ECCV
2008
Springer
16 years 26 days ago
2008
Springer
This paper improves recent methods for large scale image search. State-of-the-art methods build on the bag-of-features image representation. We, first, analyze bag-of-features in t...
DAC
2003
ACM
15 years 12 months ago
2003
ACM
Binary Decision Diagrams (BDDs) often fail to exploit sharing between Boolean functions that differ only in their support variables. In a memory circuit, for example, the function...
EVOW
2010
Springer
15 years 5 months ago
2010
Springer
Genetic algorithms (GAs) share a common weakness with most other metaheuristics: Candidate solutions are in general revisited multiple times, lowering diversity and wasting preciou...
ICB
2009
Springer
15 years 5 months ago
2009
Springer
This paper concentrates on the comparisons of systems that are used for the recognition of expressions generated by six upper face action units (AU s) by using Facial Action Coding...