198 search results - page 13 / 40 » On the Lower Bound of Local Optimums in K-Means Algorithm |
PERCOM
2008
ACM
14 years 6 months ago
2008
ACM
This paper investigates wireless sensor networks where a small percentage of nodes are assumed to know their location a priori. These reference nodes enable absolute localization ...
GECCO
2004
Springer
14 years 3 days ago
2004
Springer
Traditionally, the mutation rates of genetic algorithms are fixed or decrease over the generations. Although it seems to be reasonable for classical genetic algorithms, it may not...
ICS
2010
Tsinghua U.
14 years 4 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
IPCCC
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
IPMI
2005
Springer
14 years 7 days ago
2005
Springer
This work analyses the accuracy of estimating the location of 3D landmarks and characteristic image structures. Based on nonlinear estimation theory we study the minimal stochastic...