Estimating distances in finite metric spaces
碩士 === 元智大學 === 資訊工程學系 === 104 === Consider the problem of finding a metric \tilde{d} with a small value of \lVert \tilde{d}-d \rVert_1 / d \rVert_1 given black box access to a finite metric space (M,d). We propose randomized and deterministic algorithms for this problem.
Main Authors: | Shih-Hao Su, 蘇士豪 |
---|---|
Other Authors: | Ching-Lueh Chang |
Format: | Others |
Language: | en_US |
Published: |
2016
|
Online Access: | http://ndltd.ncl.edu.tw/handle/50489823677187276797 |
Similar Items
-
Redefinition of τ-Distance in Metric Spaces
by: Tomonari Suzuki
Published: (2017-01-01) -
Finite Asymptotic Clusters of Metric Spaces
by: Viktoriia Bilet, et al.
Published: (2018-07-01) -
OPTIMAL EMBEDDINGS OF FINITE METRIC SPACES INTO GRAPHS
by: Derya Çelik, et al.
Published: (2015-12-01) -
Existence Theorems for Generalized Distance on Complete Metric Spaces
by: Jeong Sheok Ume
Published: (2010-01-01) -
Existence Theorems for Generalized Distance on Complete Metric Spaces
by: Ume JeongSheok
Published: (2010-01-01)