Sciweavers

2600 search results - page 25 / 520
» Clustering with or without the Approximation
Sort
View
HOTOS
2007
IEEE
15 years 3 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
IJON
2007
61views more  IJON 2007»
14 years 11 months ago
Using fuzzy logic to improve a clustering technique for function approximation
Alberto Guillén, Jesús Gonzál...