Sciweavers

101 search results - page 11 / 21
» The Intractability of Computing the Hamming Distance
Sort
View
IPPS
1999
IEEE
13 years 12 months ago
Fault-Tolerant Routing Algorithms for Hypercube Networks
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
Keiichi Kaneko, Hideo Ito
ICPR
2010
IEEE
13 years 6 months ago
Face Recognition At-A-Distance Using Texture, Dense and Sparse-Stereo Reconstruction
This paper introduces a framework for long-distance face recognition using dense and sparse stereo reconstruction, with texture of the facial region. Two methods to determine corr...
Ham Rara, Asem Ali, Shireen Elhabian, Aly A. Farag
ICPADS
2000
IEEE
13 years 11 months ago
Optimal Fault-Tolerant Routing in Hypercubes Using Extended Safety Vectors
1 Reliable communication in cube-based multicomputers using the extended safety vector concept is studied in this paper. In our approach, each node in a cube-based multicomputer o...
Jie Wu, Feng Gao, Zhongcheng Li, Yinghua Min
ISMIR
2004
Springer
124views Music» more  ISMIR 2004»
14 years 28 days ago
A Comparison of Rhythmic Similarity Measures
Measuring the similarity between rhythms is a fundamental problem in computational music theory, with many applications such as music information retrieval and copyright infringem...
Godfried T. Toussaint
CVPR
2012
IEEE
11 years 10 months ago
Supervised hashing with kernels
Recent years have witnessed the growing popularity of hashing in large-scale vision problems. It has been shown that the hashing quality could be boosted by leveraging supervised ...
Wei Liu, Jun Wang, Rongrong Ji, Yu-Gang Jiang, Shi...