198 search results - page 10 / 40 » On the Lower Bound of Local Optimums in K-Means Algorithm |
COCO
2010
Springer
13 years 10 months ago
2010
Springer
We describe a new approach for the problem of finding rigid matrices, as posed by Valiant [Val77], by connecting it to the, seemingly unrelated, problem of proving lower bounds f...
ALGOSENSORS
2009
Springer
14 years 1 months ago
2009
Springer
We introduce a framework for storing and processing kinetic data observed by sensor networks. These sensor networks generate vast quantities of data, which motivates a significant...
STOC
2006
ACM
14 years 20 days ago
2006
ACM
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
WADS
2005
Springer
14 years 5 days ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
AUTOMATICA
2010
13 years 6 months ago
2010
The problem of target localization involves estimating the position of a target from multiple and typically noisy measurements of the target position. It is well known that the re...