2254 search results - page 172 / 451 » Computing the minimal covering set |
194
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Learning object categories from small samples is a challenging problem, where machine learning tools can in general provide very few guarantees. Exploiting prior knowledge may be ...
169
click to vote
SCALESPACE
2007
Springer
16 years 22 days ago
2007
Springer
In this paper, we propose a new nonparametric region-based active contour model for clutter image segmentation. To quantify the similarity between two clutter regions, we propose t...
187
click to vote
COMPGEOM
1998
ACM
15 years 11 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
181
click to vote
NIPS
2001
15 years 8 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
183
click to vote
SIAMJO
2008
15 years 6 months ago
2008
We propose a new iterative approach for solving linear programs over convex cones. Assuming that Slaters condition is satisfied, the conic problem is transformed to the minimizatio...