1403 search results - page 67 / 281 » Set cover algorithms for very large datasets |
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper describes a genetic algorithm for the DNA sequencing problem. The algorithm allows the input spectrum to contain both positive and negative errors as could be ...
COLT
2004
Springer
15 years 3 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
ISNN
2004
Springer
15 years 3 months ago
2004
Springer
Based on rank-1 update, Sparse Bayesian Learning Algorithm (SBLA) is proposed. SBLA has the advantages of low complexity and high sparseness, being very suitable for large scale pr...
SIGMOD
2001
ACM
15 years 10 months ago
2001
ACM
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
DATE
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we propose a novel approximation algorithm (RelaxSAT) for MIN-ONE SAT. RelaxSAT generates a set of constraints from the objective function to guide the search. The ...