ヒント: 日本語の検索結果のみ表示します。検索言語は [表示設定] で指定できます
In this paper we develop a linear-space algorithm for this problem for the case when the weight of any edge can be computed in constant time.
The distance preserving graph embedding problem is to embed the vertices of a given weighted graph onto points in d-dimensional Euclidean space for a ...
The distance preserving graph embedding problem is to embed vertices of a given weighted graph into points in 2-dimensional Euclidean space so that for each ...
The distance preserving graph embedding problem is to embed the vertices of a given weighted graph onto points in d-dimensional Euclidean space for a constant d ...
The distance preserving graph embedding problem is to embed the vertices of a given weighted graph onto points in d-dimensional Euclidean space for a ...
A linear-space algorithm for distance preserving graph embedding ; 巻: 42 ; 号: 4 ; 開始ページ: 289 ; 終了ページ: 304 ; 記述言語: 英語 ...
The resulting spectral-GMDS procedure enables efficient embedding by incorporating smoothness of the metric structure into the problem, ...
The distance preserving graph embedding problem is to embed the vertices of a given weighted graph onto points in d-dimensional Euclidean space for a ...
Linear-Space Algorithms for Distance Preserving Embedding.
www.researchgate.net › publication › 22...
The distance preserving graph embedding problem is to embed vertices of a given weighted graph into points in 2-dimensional Euclidean space so that for each ...
Theorem. Given n objects, a function evaluating the dissimilarity between any pair of objects in O(1) time, and an integer k < n, we can.