388 search results - page 23 / 78 » Convergence Properties of the K-Means Algorithms |
SIAMSC
2008
15 years 1 months ago
2008
Abstract. A new iterative algorithm for the solution of minimization problems in infinitedimensional Hilbert spaces which involve sparsity constraints in form of p-penalties is pro...
ESANN
2001
15 years 2 months ago
2001
In this paper, we present the results of an experimental comparison among seven different weight initialization methods in twelve different problems. The comparison is performed by...
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our invest...
103
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
138
click to vote
SIROCCO
2010
15 years 2 months ago
2010
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...