Sciweavers

516 search results - page 41 / 104
» Sets of k-Independent Strings
Sort
View
STACS
1999
Springer
14 years 1 months ago
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines
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...
Clemens Lautemann, Nicole Schweikardt, Thomas Schw...
GECCO
2000
Springer
106views Optimization» more  GECCO 2000»
14 years 11 days ago
A Genetic Segmentation Algorithm for Image Data Streams and Video
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...
Patrick Chiu, Andreas Girgensohn, Wolfgang Polak, ...
CIKM
2008
Springer
13 years 10 months ago
Scalable complex pattern search in sequential data
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...
Leila Kaghazian, Dennis McLeod, Reza Sadri
CATS
2008
13 years 10 months ago
Generating Balanced Parentheses and Binary Trees by Prefix Shifts
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...
Frank Ruskey, Aaron Williams
ICPR
2010
IEEE
13 years 10 months ago
Binary Representations of Fingerprint Spectral Minutiae Features
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...
Haiyun Xu, Raymond Veldhuis