516 search results - page 41 / 104 » Sets of k-Independent Strings |
102
click to vote
STACS
1999
Springer
15 years 3 months ago
1999
Springer
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
93
Voted
GECCO
2000
Springer
15 years 2 months ago
2000
Springer
We describe a genetic segmentation algorithm for image data streams and video. This algorithm operates on segments of a string representation. It is similar to both classical gene...
100
click to vote
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
Searching data streams has been traditionally very limited, either in the complexity of the search or in the size of the searched dataset. In this paper, we investigate the design...
66
Voted
CATS
2008
15 years 17 days ago
2008
We show that the set Bn of balanced parenthesis strings with n left and n right parentheses can be generated by prefix shifts. If b1, b2, . . . , b2n is a member of Bn, then the k...
63
Voted
ICPR
2010
IEEE
15 years 7 days ago
2010
IEEE
A fixed-length binary representation of a fingerprint has the advantages of a fast operation and a small template storage. For many biometric template protection schemes, a binary...