Results 201 to 210 of about 21,099 (238)
Some of the next articles are maybe not open access.
Voronoi treemap in Manhattan distance and Chebyshev distance
Information Visualization, 2023The ordinary Voronoi treemap generated based on the Euclidean distance function has the flexibility to slightly adjust the layout when visualizing time-varying hierarchical data for better visual quality, preserving neighborhood relationships, and preserving a stable layout.
Yan-Chao Wang, Yidan Xing
exaly +2 more sources
Quantum k-means algorithm based on Manhattan distance
Quantum Information Processing, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhihao Wu, Tingting Song, Yanbing Zhang
openaire +1 more source
ON PLANAR MEDIANOID COMPETITIVE LOCATION PROBLEMS WITH MANHATTAN DISTANCE [PDF]
Asia-Pacific Journal of Operational Research, 2013 A medianoid problem is a competitive location problem that determines the locations of a number of new service facilities that are competing with existing facilities for service to customers. This paper studies the medianoid problem on the plane with Manhattan distance.
Fu, Ke, Miao, Zhaowei, Xu, Jiayan
openaire +2 more sources
Cophenetic Median Trees Under the Manhattan Distance
Proceedings of the 8th ACM International Conference on Bioinformatics, Computational Biology,and Health Informatics, 2017Computing median trees from gene trees using path-difference metrics has provided several credible species tree estimates. Similar to these metrics is the cophenetic family of metrics that originates from a dendrogram comparison metric introduced more than 50 years ago.
Alexey Markin, Oliver Eulenstein
openaire +1 more source
Stochastic Computing Chip for Measurement of Manhattan Distance
Japanese Journal of Applied Physics, 2006We have proposed a stochastic computing system utilizing arbitrary chaos generators as random signal generators. The system can execute linear and nonlinear computations using the representation of analog quantities by pulse densities with random signals.
Michihiro Hori +2 more
openaire +1 more source
Equispreading tree in Manhattan distance
Algorithmica, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
The Application of Manhattan Tangent Distance in Outdoor Fingerprint Localization
2018 IEEE Global Communications Conference (GLOBECOM), 2018Received signal strength (RSS) is a typical measurement used for indoor and outdoor localization because of its low power consumption and no requirement of additional mode. Fingerprint localization is known to have higher accuracy than traditional methods and the most frequently used algorithm is K Nearest Neighbors (KNN), where common metrics have ...
Zhihe Li +3 more
openaire +1 more source
Characteristics of Distance Matrices Based on Euclidean, Manhattan and Hausdorff Coefficients
Journal of Classification, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Ensemble Synthetic Oversampling with Manhattan Distance for Unbalanced Hyperspectral Data
2021Hyperspectral imaging is a spectroscopic imaging technique that can cover a broad range of electromagnetic wavelengths and subdivide those into spectral bands. As a consequence, it may distinguish specific features more effectively than conventional colour cameras.
Tajul Miftahushudur +2 more
openaire +2 more sources