839 search results - page 19 / 168 » Three-Clustering of Points in the Plane |
134
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
Given a point set P R2 , a subset Q P is an -kernel of P if for every slab W containing Q, the (1+)-expansion of W also contains P. We present a data-stream algorithm for mainta...
156
click to vote
ESANN
2007
15 years 7 months ago
2007
Local algorithms for non-linear dimensionality reduction [1], [2], [3], [4], [5] and semi-supervised learning algorithms [6], [7] use spectral decomposition based on a nearest neig...
126
click to vote
DCC
1998
IEEE
15 years 5 months ago
1998
IEEE
It is shown that a partial unital with more than q √ q+1− √ q points in the Desarguesian plane of order q can be extended to a unital.
181
click to vote
STACS
2007
Springer
16 years 5 days ago
2007
Springer
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
124
Voted
COMPGEOM
2009
ACM
16 years 18 days ago
2009
ACM
Given a set of n points in the plane and a collection of k halving lines of P â„“1, . . . , â„“k indexed according to the increasing order of their slopes, we denote by d(â„“j, â„...