Sciweavers

140 search results - page 11 / 28
» String Quartets In Binary
Sort
View
IJFCS
2002
58views more  IJFCS 2002»
13 years 7 months ago
Vector Algorithms for Approximate String Matching
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
Anne Bergeron, Sylvie Hamel
CVPR
2012
IEEE
11 years 10 months ago
FREAK: Fast Retina Keypoint
A large number of vision applications rely on matching keypoints across images. The last decade featured an arms-race towards faster and more robust keypoints and association algo...
Alexandre Alahi, Raphael Ortiz, Pierre Vandergheyn...
DI
2006
156views more  DI 2006»
13 years 7 months ago
Identifying almost identical files using context triggered piecewise hashing
Fuzzy hashing allows the discovery of potentially incriminating documents that may not be located using traditional hashing methods. The use of the fuzzy hash is much like the fuz...
Jesse D. Kornblum
AMFG
2007
IEEE
315views Biometrics» more  AMFG 2007»
14 years 1 months ago
Structured Ordinal Features for Appearance-Based Object Representation
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...
ShengCai Liao, Zhen Lei, Stan Z. Li, Xiaotong Yuan...
CEC
2010
IEEE
13 years 8 months ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius