4488 search results - page 201 / 898 » Properties of NP-Complete Sets |
COMPGEOM
2008
ACM
13 years 10 months ago
2008
ACM
The Johnson-Lindenstrauss random projection lemma gives a simple way to reduce the dimensionality of a set of points while approximately preserving their pairwise distances. The m...
EUSFLAT
2007
13 years 9 months ago
2007
Methods like DBSCAN are widely used in the analysis of spatial data. These methods are based on the neighborhood relations which use distance between points. However, these neighb...
BILDMED
2006
13 years 9 months ago
2006
Abstract. We propose an algorithm for the segmentation of blood vessels in the kind of CT-data typical for diagnostics in a clinical environment. Due to poor quality and variance i...
NIPS
2003
13 years 9 months ago
2003
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the ide...
COMGEO
2008
ACM
13 years 8 months ago
2008
ACM
Given a set of points P Rd and value > 0, an -core-set S P has the property that the smallest ball containing S is within of the smallest ball containing P. This paper shows ...