Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Alexandros Kalousis

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Maurits Diephuis

> Home > Persons > Alexandros Kalousis

Publications

2019
[c46]
- view
  - electronic edition @ mlr.press (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/acml/MollaysaKBD19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/acml/MollaysaKBD19
Amina Mollaysa, Alexandros Kalousis, Eric Bruno, Maurits Diephuis:
Learning to Augment with Feature Side-information. ACML 2019: 173-187
[c44]
- view
  - electronic edition @ bmvc2019.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/bmvc/RamapuramDLWK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bmvc/RamapuramDLWK19
Jason Ramapuram, Maurits Diephuis, Frantzeska Lavda, Russ Webb, Alexandros Kalousis:
Variational Saccading: Efficient Inference for Large Resolution Images. BMVC 2019: 119
2018
[i14]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1812-03170
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1812-03170
Jason Ramapuram, Maurits Diephuis, Russ Webb, Alexandros Kalousis:
Variational Saccading: Efficient Inference for Large Resolution Images. CoRR abs/1812.03170 (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.