9572 search results - page 128 / 1915 » Cover Algorithms and Their Combination |
130
Voted
CVPR
2007
IEEE
16 years 7 months ago
2007
IEEE
This paper presents a novel unsupervised color segmentation scheme named ROI-SEG, which is based on the main idea of combining a set of different sub-segmentation results. We prop...
143
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in Rd by another. We apply this framework to the following problems: (i) hit...
155
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
152
click to vote
MOC
1998
15 years 4 months ago
1998
Abstract. A sweep-plane algorithm of Lawrence for convex polytope computation is adapted to generate random tuples on simple polytopes. In our method an affine hyperplane is swept ...
148
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
Pattern ordering is an important task in data mining because the number of patterns extracted by standard data mining algorithms often exceeds our capacity to manually analyze the...