Results 221 to 230 of about 641,465 (260)
Some of the next articles are maybe not open access.
Computer Vision and Image Understanding, 2013
In this paper we introduce a minimum barrier distance, MBD, defined for the (graphs of) real-valued bounded functions f"A, whose domain D is a compact subsets of the Euclidean space R^n. The formulation of MBD is presented in the continuous setting, where D is a simply connected region in R^n, as well as in the case where D is a digital scene.
Robin Strand +3 more
openaire +1 more source
In this paper we introduce a minimum barrier distance, MBD, defined for the (graphs of) real-valued bounded functions f"A, whose domain D is a compact subsets of the Euclidean space R^n. The formulation of MBD is presented in the continuous setting, where D is a simply connected region in R^n, as well as in the case where D is a digital scene.
Robin Strand +3 more
openaire +1 more source
Minimum backward fréchet distance
Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014We propose a new measure to capture similarity between polygonal curves, called the minimum backward Frechet distance. It is a natural optimization on the weak Frechet distance, a variant of the well-known Frechet distance. More specifically, for a given threshold e, we are searching for a pair of walks for two entities on the two input curves, T1 and ...
Amin Gheibi +3 more
openaire +1 more source
Weighted minimum backward Fréchet distance [PDF]
Theoretical Computer Science, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amin Gheibi +2 more
openaire +2 more sources
Minimum Polarized Distance Codes
IBM Journal of Research and Development, 1961The choice of a code for a given application is influenced by many factors, such as economics, compatibility, and reliability. This paper is concerned solely with the reliability of codes, and shows how, for a given number of bits per character and a given minimum distance, the probability of undetected error in an asymmetric channel may be reduced by ...
openaire +2 more sources
Mean distance and minimum degree
Journal of Graph Theory, 1997The authors prove that for any graph of order \(n\) and minimum degree \(d\), the mean distance does not exceed \(n/(d+1)+2\) and that this bound is close to an optimal bound.
Mekkia Kouider, Peter Winkler 0001
openaire +2 more sources
Viewing distance with minimum heterophoria
Clinical and Experimental Optometry, 1999BACKGROUND: The purposes of this study are to determine the viewing distance with minimum heterophoria and its relationship with refractive error and the resting position of accommodation. METHODS: The heterophoria and the accommodation responses of 36 optometry students (25 emmetropes and 11 myopes) were tested. Heterophoria was measured with the Free-
Ai-Hong, Chen, Abdul, Aziz
openaire +2 more sources
Minimum distance routing in the bidirectional shufflenet
Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98CH36169), 2002In this paper we study the bidirectional shufflenet topology, which is obtained from the well-known (unidirectional) shufflenet by considering bidirectional links. More specifically, we define a shortest-path routing algorithm, and derive the diameter and the average distance of the topology.
NERI F. +3 more
openaire +2 more sources
On the minimum distances of Schubert codes
IEEE Transactions on Information Theory, 2000Summary: \textit{S. R. Ghorpade} and \textit{G. Lachaud} [Proc. Int. Conf. Coding Theory, Cryptography and Related Areas (Springer, Berlin), 122-131 (2000; Zbl 1021.94026)] introduced Schubert codes as codes corresponding to the projective system [\textit{M. A. Tsfasman} and \textit{S. G.
openaire +1 more source
Minimum Average Distance Clique Trees
SIAM Journal on Discrete Mathematics, 2015Summary: Chordal graphs have been extensively studied and have applications in various fields, including computational biology, sparse matrix computation, and graphical models. They are characterized by the existence of clique trees, whose vertices correspond to the maximal cliques of a chordal graph.
Shou-Jun Xu, Rob Gysel, Dan Gusfield
openaire +2 more sources
On generalized minimum distance decoding
1989A numerical method to compute the performance probabilities of GMD decoders is proposed for binary antipodal signaling on the AWGN channel with coherent reception. Plots of the probability of decoding failure and of the bit error rate are presented for triple-error-correcting extended BCH codes of length 64 and 128.
openaire +1 more source