352 search results - page 7 / 71 » A local search approximation algorithm for k-means clusterin... |
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
74
Voted
MM
2004
ACM
15 years 2 months ago
2004
ACM
It is important and challenging to make the growing image repositories easy to search and browse. Image clustering is a technique that helps in several ways, including image data ...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
SBIA
2004
Springer
15 years 2 months ago
2004
Springer
A challenge in hybrid evolutionary algorithms is to define efficient strategies to cover all search space, applying local search only in actually promising search areas. This pape...
PODS
2008
ACM
15 years 9 months ago
2008
ACM
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...