Biblio Discovery — Demo Discovery Service

4 hasil untuk "Anastasios Sidiropoulos"

Menampilkan 1–4 · 0,12 detik · RSS

  1. Artikel Jurnal

    Fat polygonal partitions with applications to visualization and embeddings

    Mark de Berg; Krzysztof Onak; Anastasios Sidiropoulos

    Journal of Computational Geometry, Vol. 4 No. 1 · 2013 · Inggris · DOAJ Scopus

    Let T be a rooted and weighted tree, where the weight of any node is equal to the sum of the weights of its children. The popular Treemap algorithm visualizes such a tree as a hierarchical partition of a square into rectangles, where the area of the rectangle corresponding to any node in T is equal…

  2. Artikel Jurnal

    Approximate greedy clustering and distance selection for graph metrics

    David Eppstein; Sariel Har-Peled; Anastasios Sidiropoulos

    Journal of Computational Geometry, Vol. 11 No. 1 · 2020 · Inggris · DOAJ Scopus

    In this paper, we consider two important problems defined on finite metric spaces, and provide efficient new algorithms and approximation schemes for these problems on inputs given as graph shortest path metrics or high-dimensional Euclidean metrics. The first of these problems is the greedy…

  3. Artikel Jurnal

    Geometric Algorithms for k-NN Poisoning

    Diego Ihara Centurion; Karine Chubarian; Bohan Fan dkk.

    Computing in Geometry and Topology, Vol. 4 No. 2 · 2025 · Inggris · DOAJ

    We propose a label poisoning attack on geometric data sets against k-nearest neighbor classification. We provide an algorithm that can compute an εn-additive approximation of the optimal poisoning in n 22^{O(d+k/\ε)} time for a given data set X in R⁠d, where |X| = n. Our algorithm achieves its…