COMGEO 2004 - PDF Preprint Papers

COMGEO 2004 International Conference and Exhibition on Computing for Geospatial Research & Application

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COMGEO-2004 Paper

click to vote

COMGEO
2004
ACM

222views Applied Computing» more COMGEO 2004»

A local search approximation algorithm for k-means clustering

13 years 11 months ago

Download www.cs.umd.edu

In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...

Tapas Kanungo, David M. Mount, Nathan S. Netanyahu...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	222	A local search approximation algorithm for k-means clustering	claim
2	145	Approximating geometric bottleneck shortest paths	claim
3	129	How to draw the minimum cuts of a planar graph	claim
4	117	A global approach to automatic solution of jigsaw puzzles	claim
5	110	A lower bound on the number of triangulations of planar point sets	claim
6	102	Box-trees for collision checking in industrial installations	claim
7	101	Conforming Delaunay triangulations in 3D	claim
8	98	Expected time analysis for Delaunay point location	claim
9	95	Parametric search made practical	claim
10	94	On the number of views of translates of a cube and related problems	claim
11	93	On simplifying dot maps	claim
12	93	The weighted farthest color Voronoi diagram on trees and graphs	claim
13	90	Collision detection for deforming necklaces	claim
14	90	Speeding up the incremental construction of the union of geometric objects in practice	claim
15	89	Ordered theta graphs	claim
16	89	Tiling space and slabs with acute tetrahedra	claim
17	88	Convexity minimizes pseudo-triangulations	claim
18	87	Kinetic collision detection between two simple polygons	claim
19	86	A multi-dimensional approach to force-directed layouts of large graphs	claim
20	86	Minimal enclosing parallelepiped in 3D	claim
21	85	Proximity drawings in polynomial area and volume	claim
22	83	Visibility preserving terrain simplification-- an experimental study	claim
23	83	Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains	claim
24	79	Rotationally optimal spanning and Steiner trees in uniform orientation metrics	claim
25	78	Proximate point searching	claim
26	74	Facility location and the geometric minimum-diameter spanning tree	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers