DC Field | Value | Language |
---|---|---|
dc.contributor.author | Dress, A | - |
dc.contributor.author | Huber, K | - |
dc.contributor.author | Koolen, J | - |
dc.contributor.author | Moulton, V | - |
dc.contributor.author | Spillner, A | - |
dc.date.accessioned | 2016-04-01T02:40:34Z | - |
dc.date.available | 2016-04-01T02:40:34Z | - |
dc.date.created | 2010-11-24 | - |
dc.date.issued | 2010-09 | - |
dc.identifier.issn | 0176-4268 | - |
dc.identifier.other | 2010-OAK-0000022019 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/25566 | - |
dc.description.abstract | The theory of the tight span, a cell complex that can be associated to every metric D, offers a unifying view on existing approaches for analyzing distance data, in particular for decomposing a metric D into a sum of simpler metrics as well as for representing it by certain specific edge-weighted graphs, often referred to as realizations of D. Many of these approaches involve the explicit or implicit computation of the so-called cutpoints of (the tight span of) D, such as the algorithm for computing the "building blocks" of optimal realizations of D recently presented by A. Hertz and S. Varone. The main result of this paper is an algorithm for computing the set of these cutpoints for a metric D on a finite set with n elements in O(n3) time. As a direct consequence, this improves the run time of the aforementioned O(n6)-algorithm by Hertz and Varone by "three orders of magnitude". | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | SPRINGER | - |
dc.relation.isPartOf | JOURNAL OF CLASSIFICATION | - |
dc.subject | Metric | - |
dc.subject | Cutpoint | - |
dc.subject | Realization | - |
dc.subject | Tight span | - |
dc.subject | Decomposition | - |
dc.subject | Block | - |
dc.subject | BLOCK REALIZATIONS | - |
dc.subject | PARTITION PROBLEM | - |
dc.subject | CUT POINTS | - |
dc.title | An Algorithm for Computing Cutpoints in Finite Metric Spaces | - |
dc.type | Article | - |
dc.contributor.college | 수학과 | - |
dc.identifier.doi | 10.1007/S00357-010-9055-7 | - |
dc.author.google | Dress, A | - |
dc.author.google | Huber, K | - |
dc.author.google | Koolen, J | - |
dc.author.google | Moulton, V | - |
dc.author.google | Spillner, A | - |
dc.relation.volume | 27 | - |
dc.relation.issue | 2 | - |
dc.relation.startpage | 158 | - |
dc.relation.lastpage | 172 | - |
dc.contributor.id | 10200295 | - |
dc.relation.journal | JOURNAL OF CLASSIFICATION | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCIE | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | JOURNAL OF CLASSIFICATION, v.27, no.2, pp.158 - 172 | - |
dc.identifier.wosid | 000282102500003 | - |
dc.date.tcdate | 2019-02-01 | - |
dc.citation.endPage | 172 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 158 | - |
dc.citation.title | JOURNAL OF CLASSIFICATION | - |
dc.citation.volume | 27 | - |
dc.contributor.affiliatedAuthor | Koolen, J | - |
dc.identifier.scopusid | 2-s2.0-77957146041 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 6 | - |
dc.description.scptc | 6 | * |
dc.date.scptcdate | 2018-05-121 | * |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | Metric | - |
dc.subject.keywordAuthor | Cutpoint | - |
dc.subject.keywordAuthor | Realization | - |
dc.subject.keywordAuthor | Tight span | - |
dc.subject.keywordAuthor | Decomposition | - |
dc.subject.keywordAuthor | Block | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Interdisciplinary Applications | - |
dc.relation.journalWebOfScienceCategory | Psychology, Mathematical | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | ssci | - |
dc.description.journalRegisteredClass | ahci | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalResearchArea | Psychology | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.