نتایج جستجو برای: in euclidean distance of25

تعداد نتایج: 17004622  

Journal: :Advances in Applied Mathematics 2020

Journal: :Journal of Approximation Theory 1992

2006
R. Balaji R. B. Bapat

If A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive a formula for the Moore-Penrose inverse of PAP . As an application, we obtain a formula for the MoorePenrose inverse of a Euclidean distance matrix (EDM) which generalizes formulae for the inverse of a EDM in the literature. To an invertible spherical EDM, we associate a Laplacian matrix (which w...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه رازی - دانشکده علوم 1387

boron nitride semiconducting zigzag swcnt, $b_{cb}$$n_{cn}$$c_{1-cb-cn}$, as a potential candidate for making nanoelectronic devices was examined. in contrast to the previous dft calculations, wherein just one boron and nitrogen doping configuration have been considered, here for the average over all possible configurations, density of states (dos) was calculated in terms of boron and nitrogen ...

Journal: :Computational Geometry: Theory and Applications 2023

The Gromov-Hausdorff distance (dGH) proves to be a useful measure between shapes. In order approximate dGH for X,Y⊂Rd, we look into its relationship with dH,iso, the infimum Hausdorff under Euclidean isometries. As already known dimension d≥2, dH,iso cannot bounded above by constant factor times dGH. For d=1, however, prove that dH,iso≤54dGH. We also show bound is tight. effect, X,Y⊂R at most n...

2007
Jérôme Revaud Guillaume Lavoué Atilla Baskurt

This paper presents a novel and robust algorithm that retrieves the rotation angle between two different patterns, together with their similarity degree. The result is optimal in the sense that it minimizes the euclidean distance between the two images. This approach is based on Zernike moments and constitutes a new way to compare two Zernike descriptors that improves standard Euclidean approac...

2013
Cong Xie Hui Lei Xing Xu Weifeng Chen Haidong Chen Jinsong Yang Danfang Yan Wei Chen Senxiang Yan

基金项目:本项目得到国家自然科学基金项目(81170118、61003193)、湖南省科技计划资助项目(2010GK3064)、国家“八六三”高技术 研究发展计划(2012AA120903)、浙江省科技厅公益项目(No.2011C21058)的资助。 作者简介:解聪(1989—),男,硕士研究生,主要研究方向为医学影像可视化;雷辉(1977-),女,讲师,硕士,主要研究方向:图像 处理,小波分析;徐星(1987—),男,硕士研究生,主要研究方向为医学影像可视化;陈伟锋(1983—),男,博士,主要研究方向为科 学计算可视化;陈海东(1987—),男,博士,主要研究方向为科学计算可视化;杨劲松(1974—),男,博士,主要研究方向为放射学及 放射肿瘤学的基础临床研究;严丹方(1984—),女,硕士研究生,主要研究方向为放射学及放射肿瘤学的基础临床研究;陈为(1976—), 男,博士,教...

2017
Piotr Indyk Anastasios Sidiropoulos

An n-point metric space (X,D) can be represented by an n × n table specifying the distances. Such tables arise in many diverse areas. For example, consider the following scenario in microbiology: X is a collection of bacterial strains, and for every two strains, one is given their dissimilarity (computed, say, by comparing their DNA). It is difficult to see any structure in a large table of num...

2009
Jiaming Xu Yuxin Chen

Euclidean distance matrix completion problem aims at reconstructing the low dimensional geometry structure of nodes given only a few pairwise distances between nodes [1]. This problem arises in many applications including networks and machine learning where much information of points is laking. For instance, in sensor networks, due to the constraints of energy and communication radius, sensor n...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید