198 search results - page 5 / 40 » On the Lower Bound of Local Optimums in K-Means Algorithm |
CORR
2007
Springer
13 years 6 months ago
2007
Springer
—A unified analytical framework for optimum power allocation in the unordered V-BLAST algorithm and its comparative performance analysis are presented. Compact closed-form appro...
TIP
1998
13 years 6 months ago
1998
—The distance transform has found many applications in image analysis. Chamfer distance transforms are a class of discrete algorithms that offer a good approximation to the desir...
STOC
1997
ACM
13 years 11 months ago
1997
ACM
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
BMCBI
2007
13 years 6 months ago
2007
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...