Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Riccardo Gherardi

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 Frank Perbet

> Home > Persons > Riccardo Gherardi

Publications

2015
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/ijcv/PhamWPMGSC15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcv/PhamWPMGSC15
Minh-Tri Pham, Oliver J. Woodford, Frank Perbet, Atsuto Maki, Riccardo Gherardi, Björn Stenger, Roberto Cipolla:
Distances and Means of Direct Similarities. Int. J. Comput. Vis. 112(3): 285-306 (2015)
2013
[p1]
- view
  authority control:
- export record
  dblp key:
  - series/sci/PhamWPMGSC13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/series/sci/PhamWPMGSC13
Minh-Tri Pham, Oliver J. Woodford, Frank Perbet, Atsuto Maki, Riccardo Gherardi, Björn Stenger, Roberto Cipolla:
Scale-Invariant Vote-Based 3D Recognition and Registration from Point Clouds. Machine Learning for Computer Vision 2013: 137-162
2012
[c10]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/eccv/WoodfordPMGPS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eccv/WoodfordPMGPS12
Oliver J. Woodford, Minh-Tri Pham, Atsuto Maki, Riccardo Gherardi, Frank Perbet, Björn Stenger:
Contraction Moves for Geometric Model Fitting. ECCV (7) 2012: 181-194

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.