16404 search results - page 767 / 3281 » A set coverage problem |
224
click to vote
ICCI
1991
15 years 11 months ago
1991
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
187
click to vote
SODA
2008
ACM
15 years 9 months ago
2008
ACM
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
177
click to vote
EUSFLAT
2001
15 years 8 months ago
2001
One of the biggest problems in computer vision systems, analyzing images having high uncertainty/vagueness degree, is the treatment of such uncertainty. This problem is even clear...
208
click to vote
WOB
2004
15 years 8 months ago
2004
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...
207
click to vote
ASC
2008
15 years 7 months ago
2008
: Discovering interesting patterns or substructures in data streams is an important challenge in data mining. Clustering algorithms are very often applied to identify single substr...