1397 search results - page 6 / 280 » Algorithms for Proximity Problems on Colored Point Sets |
ITCC
2005
IEEE
14 years 28 days ago
2005
IEEE
Density-based clustering algorithms have recently gained popularity in the data mining field due to their ability to discover arbitrary shaped clusters while preserving spatial pr...
ICIP
1998
IEEE
14 years 9 months ago
1998
IEEE
In this paper, we describe a new approach for color image segmentation which is considered as a problem of pixels classification. The algorithm is applied to classify pixels of so...
SIAMDM
2010
13 years 5 months ago
2010
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
VLDB
2005
ACM
14 years 7 months ago
2005
ACM
Abstract. The outlier detection problem has important applications in the field of fraud detection, network robustness analysis, and intrusion detection. Most such applications are...