1403 search results - page 16 / 281 » Set cover algorithms for very large datasets |
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
BMCBI
2010
13 years 5 months ago
2010
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
SIGECOM
2011
ACM
12 years 11 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
FIMI
2003
13 years 9 months ago
2003
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...
CRYPTO
2012
Springer
11 years 11 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...