1
Argitaratua 2008
Aurkibidea: ... Steiner Tree Computation in Polynomial-Space -- Fitting a Step Function to a Point Set -- Faster Swap Edge...
Testu osoa
Baliabide elektronikoa eBook
2
Argitaratua 2007
Aurkibidea: ... of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces -- Maximum Edge-Disjoint Paths...
Testu osoa
Baliabide elektronikoa eBook
3
Argitaratua 2006
Aurkibidea: ... Clusters from Non-Euclidean Dissimilarity Matrix by Using Rough Clustering -- Towards Ontologies...
Testu osoa
Baliabide elektronikoa eBook