Sciweavers

140 search results - page 6 / 28
» String Quartets In Binary
Sort
View
ICPR
2010
IEEE
13 years 8 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
ECCV
2010
Springer
14 years 2 days ago
BRIEF: Binary Robust Independent Elementary Features
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...
TOIS
2002
97views more  TOIS 2002»
13 years 7 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
CATS
2008
13 years 9 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
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 7 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke