Sciweavers

516 search results - page 12 / 104
» Sets of k-Independent Strings
Sort
View
ICPR
2006
IEEE
14 years 8 months ago
Matching 2D Shapes using their Symmetry Sets
We introduce a shape descriptor that is based on the Symmetry Set. This set represents pairwise symmetric points and consists of several branches. The begin and end points of the ...
Arjan Kuijper, Ole Fogh Olsen, Philip Bille, Peter...
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
13 years 11 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 7 months ago
Partial monoids: associativity and confluence
A partial monoid P is a set with a partial multiplication
Laurent Poinsot, Gérard Duchamp, Christophe...
KDD
2002
ACM
119views Data Mining» more  KDD 2002»
14 years 8 months ago
On effective classification of strings with wavelets
In recent years, the technological advances in mapping genes have made it increasingly easy to store and use a wide variety of biological data. Such data are usually in the form o...
Charu C. Aggarwal
SPIRE
2005
Springer
14 years 29 days ago
Cache-Conscious Collision Resolution in String Hash Tables
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
Nikolas Askitis, Justin Zobel