198 search results - page 24 / 40 » On the Lower Bound of Local Optimums in K-Means Algorithm |
IOPADS
1997
13 years 9 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
GBRPR
2007
Springer
14 years 2 months ago
2007
Springer
Segmentation algorithms based on an energy minimisation framework often depend on a scale parameter which balances a fit to data and a regularising term. Irregular pyramids are de...
COCO
2009
Springer
14 years 3 months ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...