نتایج جستجو برای: row distance
تعداد نتایج: 256254 فیلتر نتایج به سال:
Rank metric codes can either be used as such for error correction in data storage equipments, or be lifted into constant-dimension codes (CDCs) and thus be used for error correction in random network coding. This paper investigates the decoder error probability (DEP) of rank metric codes and CDCs. We first study the DEP of rank metric codes using a bounded rank distance decoder. We derive asymp...
This paper presents a new technique for computing the barycenter of a set of distance or kernel matrices. These matrices, which define the interrelationships between points sampled from individual domains, are not required to have the same size or to be in row-by-row correspondence. We compare these matrices using the softassign criterion, which measures the minimum distortion induced by a prob...
Steering agricultural machinery during the harvest in fields is a tedious task for drivers. Automated guidance of the machinery will not only reduce driver fatigue but also increase productivity and safety of the harvesting operation. The existing mechanical solutions for row navigation on the sugar beet fields do not provide sufficient accuracy during the harvesting process. The next important...
In this paper we present an efficient approach for comparing protein structures based on distance matrices. In the first step, the distance matrices are calculated and normalized in order to avoid the scaling distortion. Further, versions from these matrices are saved on different scales and for each two protein structures we compare their respective equal-scaled matrices. Thus, we avoid the pr...
In this paper, a text dependent speaker recognition algorithm based on spectrogram is proposed. The spectrograms have been generated using Discrete Fourier Transform for varying frame sizes with 25% and 50% overlap between speech frames. Feature vector extraction has been done by using the row mean vector of the spectrograms. For feature matching, two distance measures, namely Euclidean distanc...
In this paper, we present a factor 16 approximation algorithm for the following NP-hard distance fitting problem: given a finite set X and a distance d on X, find a Robinsonian distance dR on X minimizing the l∞-error ||d−dR||∞ = maxx,y∈X{|d(x, y)− dR(x, y)|}. A distance dR on a finite set X is Robinsonian if its matrix can be symmetrically permuted so that its elements do not decrease when mov...
In this paper, we present a factor 16 approximation algorithm for the following NP-hard distance fitting problem: given a finite set X and a distance d on X, find a Robinsonian distance dR on X minimizing the l∞-error ||d−dR||∞ = maxx,y∈X{|d(x, y)− dR(x, y)|}. A distance dR on a finite set X is Robinsonian if its matrix can be symmetrically permuted so that its elements do not decrease when mov...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید