1397 search results - page 4 / 280 » Algorithms for Proximity Problems on Colored Point Sets |
TSE
2008
13 years 7 months ago
2008
Software end users are the best testers, who keep revealing bugs in software that has undergone rigorous in-house testing. In order to leverage their testing efforts, failure repor...
MICAI
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
FSKD
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. A fuzzy c-means algorithm incorporating the notion of dominant colors and spatial homogeneity is proposed for the color clustering problem. The proposed algorithm extract...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper presents an interior point approach to exact distance computation between convex objects represented as intersections of implicit surfaces. Exact distance computatio...
SIAMJO
2010
13 years 5 months ago
2010
Proximal bundle methods have been shown to be highly successful optimization methods for unconstrained convex problems with discontinuous first derivatives. This naturally leads ...