"On nonmetric similarity search problems in complex domains."

Tomás Skopal, Benjamin Bustos (2011)

> Home

Details and statistics

DOI: 10.1145/1978802.1978813

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/csur/SkopalB11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/csur/SkopalB11
Tomás Skopal, Benjamin Bustos:
On nonmetric similarity search problems in complex domains. ACM Comput. Surv. 43(4): 34:1-34:50 (2011)

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.