16404 search results - page 242 / 3281 » A set coverage problem |
129
click to vote
BMVC
2010
15 years 2 months ago
2010
Variational level set methods are formulated as energy minimisation problems, which are often solved by gradient-based optimisation methods, such as gradient descent. Unfortunatel...
101
click to vote
CADE
2001
Springer
16 years 4 months ago
2001
Springer
We present a tool deciding a fragment of set theory. It is designed to be easily accessible via the internet and intuitively usable by anyone who is working with sets to describe a...
CIKM
2007
Springer
15 years 10 months ago
2007
Springer
We present a simple and efficient external perfect hashing scheme (referred to as EPH algorithm) for very large static key sets. We use a number of techniques from the literature ...
126
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
148
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
One of the major problems in frequent pattern mining is the explosion of the number of results, making it difficult to identify the interesting frequent patterns. In a recent pap...