198 search results - page 39 / 40 » On the Lower Bound of Local Optimums in K-Means Algorithm |
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
SENSYS
2009
ACM
14 years 2 months ago
2009
ACM
Having access to an accurate time is a vital building block in all networks; in wireless sensor networks even more so, because wireless media access or data fusion may depend on i...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
: We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For ...
KR
2004
Springer
14 years 21 days ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
SIAMMAX
2010
13 years 2 months ago
2010
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...