5215 search results - page 302 / 1043 » Quantum clustering algorithms |
210
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
163
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
Genetic Algorithms (GAs) have been known to be robust for search and optimization problems. Image registration can take advantage of the robustness of GAs in finding best transform...
164
click to vote
IS
2007
15 years 6 months ago
2007
Emerging applications introduce the requirement for novel association-rule mining algorithms that will be scalable not only with respect to the number of records (number of rows) ...
178
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
169
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
We present a principled Bayesian framework for modeling partial memberships of data points to clusters. Unlike a standard mixture model which assumes that each data point belongs ...