Results 21 to 30 of about 114,723 (161)
Existing secure two-party Euclidean distance computation schemes are mostly performed based on a semi-honest model, which faces bottlenecks in computation efficiency and security. In view of this, this study proposed a secure two-party euclidean distance
Li Su, Huizheng Geng, Sixu Guo, Shen He
doaj +1 more source
Defect of Euclidean distance degree
Two well studied invariants of a complex projective variety are the unit Euclidean distance degree and the generic Euclidean distance degree. These numbers give a measure of the algebraic complexity for "nearest" point problems of the algebraic variety. It is well known that the latter is an upper bound for the former.
Laurentiu G. Maxim +2 more
openaire +3 more sources
Prediksi Jarak Bola pada Citra Kamera Katadioptrik menggunakan metode Artifical Neural Network
ABSTRAK Saat ini, kecerdasan buatan memungkinkan untuk dikembangkan dalam dunia robotika, khususnya untuk pengaturan gerakan robot berdasarkan pengolahan citra.
ZENDI ZAKARIA RAGA PERMANA +2 more
doaj +1 more source
Euclidean Distance Degree of the Multiview Variety [PDF]
Euclidean distance degree, multiview variety, triangulation problem, non-proper Morse theory, Euler-Poincare characteristic, local Euler ...
Laurentiu G. Maxim +2 more
openaire +3 more sources
The Euclidean Distance Degree of an Algebraic Variety [PDF]
The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low rank matrices, the Eckart-Young Theorem states that this map is given by the singular value decomposition.
Jan Draisma +4 more
openaire +7 more sources
Portfolio Evaluation with the Vector Distance Based on Portfolio Composition
We propose a novel portfolio evaluation method, a distance-based approach, which directly evaluates the portfolio composition rather than portfolio returns.
Heonbae Jeon +4 more
doaj +1 more source
On the existence of Hamiltonian cycles in hypercubes [PDF]
Building on the results of our previous work on Euclidean leaper tours, considering all integers k>1 and h>0, we study the existence of Hamiltonian cycles in the vertex set C(2,k):={0,1}ᵏ of the k-dimensional hypercube when the Euclidean distance between
Gabriele Di Pietro, Marco Ripà
doaj +1 more source
Euclidean Nature of Phylogenetic Distance Matrices [PDF]
Phylogenies are fundamental to comparative biology as they help to identify independent events on which statistical tests rely. Two groups of phylogenetic comparative methods (PCMs) can be distinguished: those that take phylogenies into account by introducing explicit models of evolution and those that only consider phylogenies as a statistical ...
de Vienne, Damien M. +2 more
openaire +3 more sources
Road distance and travel time for an improved house price Kriging predictor
The paper designs an automated valuation model to predict the price of residential property in Coventry, United Kingdom, and achieves this by means of geostatistical Kriging, a popularly employed distance-based learning method.
Henry Crosby +5 more
doaj +1 more source
Optimizing Euclidean Distance Computation
This paper presents a comparative analysis of seventeen different approaches to optimizing Euclidean distance computations, which is a core mathematical operation that plays a critical role in a wide range of algorithms, particularly in machine learning ...
Rustam Mussabayev
doaj +1 more source

