1085 search results - page 13 / 217 » Hug over a distance |
IPL
2008
13 years 8 months ago
2008
![Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time")
Given two strings, a pattern P of length m and a text T of length n over some alphabet , we consider the string matching problem under k mismatches. The well
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
In this paper we propose diffusion distance, a new dissimilarity measure between histogram-based descriptors. We define the difference between two histograms to be a temperature f...
SIAMDM
2010
13 years 7 months ago
2010
This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes in Rn . We show that the minimum distance is multipli...
JCO
1998
13 years 8 months ago
1998
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...
CATE
2004
13 years 10 months ago
2004
Network EducationWare (NEW) is an integrated collection of open-source software for synchronous Internet communication, where a class is simultaneously taught to local students an...