Anastasios Sidiropoulos

◀ ▶ joint publications with Neshat Mohammadi

> Home > Persons > Anastasios Sidiropoulos

Publications

2020
[c54]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/approx/FanIMSSV20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/FanIMSSV20
Bohan Fan, Diego Ihara, Neshat Mohammadi, Francesco Sgherzi, Anastasios Sidiropoulos, Mina Valizadeh:
Learning Lines with Ordinal Constraints. APPROX-RANDOM 2020: 45:1-45:15
2019
[c51]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/compgeom/IharaMS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/IharaMS19
Diego Ihara, Neshat Mohammadi, Anastasios Sidiropoulos:
Algorithms for Metric Learning via Contrastive Embeddings. SoCG 2019: 45:1-45:14
[i39]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1905-09989
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1905-09989
Diego Ihara, Neshat Mohammadi, Anastasios Sidiropoulos:
Learning Mahalanobis Metric Spaces via Geometric Approximation Algorithms. CoRR abs/1905.09989 (2019)
2018
[i34]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1807-04881
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1807-04881
Diego Ihara Centurion, Neshat Mohammadi, Anastasios Sidiropoulos:
Algorithms for metric learning via contrastive embeddings. CoRR abs/1807.04881 (2018)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.