1298 search results - page 71 / 260 » The online set cover problem |
167
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
Although widely studied for many years, colour quantisation remains a practical problem in image processing. Unlike previous works where the image can only be quantised after the ...
197
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Although there are a large number of thesauri for the biomedical domain many of them lack coverage in terms and their variant forms. Automatic thesaurus construction b...
179
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
147
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
205
click to vote
RTCSA
2003
IEEE
15 years 11 months ago
2003
IEEE
Current hard real-time technologies are unable to support a new class of applications that have real-time constraints but with dynamic request arrivals and unpredictable resource r...