Kim L. Boyer

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 Muhammad J. Mirza

> Home > Persons > Kim L. Boyer

Publications

1994
[j17]
- view
  authority control:
- export record
  dblp key:
  - journals/pami/BoyerMG94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pami/BoyerMG94
Kim L. Boyer, Muhammad J. Mirza, Gopa Ganguly:
The Robust Sequential Estimator: A General Approach and its Application to Surface Organization in Range Data. IEEE Trans. Pattern Anal. Mach. Intell. 16(10): 987-1001 (1994)
1993
[j13]
- view
  authority control:
- export record
  dblp key:
  - journals/trob/MirzaB93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/trob/MirzaB93
Muhammad J. Mirza, Kim L. Boyer:
Performance evaluation of a class of M-estimators for surface parameter estimation in noisy range data. IEEE Trans. Robotics Autom. 9(1): 75-85 (1993)
1992
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/cvpr/MirzaB92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cvpr/MirzaB92
Muhammad J. Mirza, Kim L. Boyer:
An information theoretic robust sequential procedure for surface model order selection in noisy range data. CVPR 1992: 366-371
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/iros/MirzaB92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iros/MirzaB92
Muhammad J. Mirza, Kim L. Boyer:
A Robust Sequential Procedure For Surface Parameter Estimation And Curvature Computation. IROS 1992: 2017-2026

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.