16404 search results - page 317 / 3281 » A set coverage problem |
143
click to vote
CAINE
2003
15 years 6 months ago
2003
Clustering is the process of subdividing an input data set into a desired number of subgroups so that members of the same subgroup are similar and members of different subgroups h...
128
click to vote
LOGCOM
2007
15 years 4 months ago
2007
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
157
click to vote
TEC
2010
14 years 11 months ago
2010
Abstract--Assuming that evolutionary multiobjective optimization (EMO) mainly deals with set problems, one can identify three core questions in this area of research: (i) how to fo...
134
click to vote
ICCV
2001
IEEE
16 years 6 months ago
2001
IEEE
The number of features that can be computed over an image is, for practical purposes, limitless. Unfortunately, the number of features that can be computed and exploited by most c...
115
click to vote
WWW
2006
ACM
16 years 5 months ago
2006
ACM
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...