"Selecting Good Keys for Triangle-Inequality-Based Pruning Algorithms."

Andrew Berman, Linda G. Shapiro (1998)

> Home

Details and statistics

DOI: 10.1109/CAIVD.1998.646029

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/caivd/BermanS98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/caivd/BermanS98
Andrew Berman, Linda G. Shapiro:
Selecting Good Keys for Triangle-Inequality-Based Pruning Algorithms. CAIVD 1998: 12-19

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.