NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.072 seconds)

Spelling suggestions: "subject:"approximately kmeans"" "subject:"approximately bymeans""

1

APPROXIMATE N-NEAREST NEIGHBOR CLUSTERING ON DISTRIBUTED DATABASES USING ITERATIVE REFINEMENT

CALENDER, CHRISTOPHER R. 06 October 2004 (has links)
No description available.
Computer Science
nearest neighbor
cluster
K-means
clustering
approximate nearest neighbor
approximate k-means

Page generated in 0.0757 seconds