CORR
2010
Springer
12 years 11 months ago
2010
Springer
The concept of effective complexity of an object as the minimal description length of its regularities has been initiated by Gell-Mann and Lloyd. The regularities are modeled by m...
DM
2011
12 years 11 months ago
2011
The Fibonacci cube Γn is the subgraph of the n-cube induced by the binary strings that contain no two consecutive 1’s. The Lucas cube Λn is obtained
TCS
2002
13 years 4 months ago
2002
We study the relationship between a computably enumerable real and its presentations: ways of approximating the real by enumerating a prefix-free set of binary strings.
IPL
1998
13 years 4 months ago
1998
Given a decision problem P and a probability distribution over binary strings, for each n, draw independently an instance xn of P of length n. What is the probability that there i...
ARSCOM
2005
13 years 4 months ago
2005
We look at binary strings of length n which contain no odd run of zeros and express the total number of such strings, the number of zeros, the number of ones, the total number of ...
COMBINATORICS
2007
13 years 4 months ago
2007
A k-ary necklace of order n is an equivalence class of strings of length n of symbols from {0, 1, . . . , k − 1} under cyclic rotation. In this paper we define an ordering on t...
ECCV
2010
Springer
13 years 9 months ago
2010
Springer
We propose to use binary strings as an efficient feature point descriptor, which we call BRIEF. We show that it is highly discriminative even when using relatively few bits and can...
SPIRE
2005
Springer
13 years 10 months ago
2005
Springer
Given two n-bit (cyclic) binary strings, A and B, represented on a circle (necklace instances). Let each sequence have the same number k of 1’s. We are interested in computing th...
AMFG
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper, we propose a novel appearance-based representation, called Structured Ordinal Feature (SOF). SOF is a binary string encoded by combining eight ordinal blocks in a ci...