Sciweavers

421 search results - page 35 / 85
» String Distances and Uniformities
Sort
View
GECCO
2007
Springer
174views Optimization» more  GECCO 2007»
15 years 10 months ago
Geometric crossovers for real-code representation
Geometric crossover is a representation-independent generalization of the class of traditional mask-based crossover for binary strings. It is based on the distance of the search s...
Yourim Yoon, Yong-Hyuk Kim, Alberto Moraglio, Byun...
JMLR
2010
111views more  JMLR 2010»
14 years 11 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...
ICASSP
2011
IEEE
14 years 8 months ago
A method to infer emotions from facial Action Units
We present a robust method to map detected facial Action Units (AUs) to six basic emotions. Automatic AU recognition is prone to errors due to illumination, tracking failures and ...
Sudha Velusamy, Hariprasad Kannan, Balasubramanian...
ICMCS
2006
IEEE
122views Multimedia» more  ICMCS 2006»
15 years 10 months ago
A Robust Entropy-Based Audio-Fingerprint
Audio Fingerprints (AFP’s) are compact, content-based representations of audio signals used to measure distances among them. An AFP has to be small, fast computed and robust to ...
Antonio Camarena-Ibarrola, Edgar Chávez
ECCV
2010
Springer
15 years 8 months 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...