Sciweavers

101 search results - page 10 / 21
» The Intractability of Computing the Hamming Distance
Sort
View
AROBOTS
2005
100views more  AROBOTS 2005»
13 years 7 months ago
A Sampling-Based Motion Planning Approach to Maintain Visibility of Unpredictable Targets
This paper deals with the surveillance problem of computing the motions of one or more robot observers in order to maintain visibility of one or several moving targets. The target...
Rafael Murrieta-Cid, Benjamín Tovar, Seth H...
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...
ISCAS
2003
IEEE
98views Hardware» more  ISCAS 2003»
14 years 25 days ago
Dynamic operand transformation for low-power multiplier-accumulator design
: The design of portable battery-operated devices requires low-power computation circuits. This paper presents a new multiplier-accumulator (MAC) design approach, which in contrast...
Masayoshi Fujino, Vasily G. Moshnyaga
DCC
2008
IEEE
14 years 7 months ago
Idempotents in the neighbourhood of Patterson-Wiedemann functions having Walsh spectra zeros
In this paper we study the neighbourhood of 15-variable Patterson-Wiedemann (PW) functions, i.e., the functions that differ by a small Hamming distance from the PW functions in te...
Sumanta Sarkar, Subhamoy Maitra
ICPR
2008
IEEE
14 years 2 months ago
Extraction of complex wavelet features for iris recognition
This paper presents a new feature extraction method for iris recognition. Since two dimensional complex wavelet transform (2D-CWT) does not only keep wavelet transform’s propert...
XiaoFu He, Pengfei Shi