1403 search results - page 84 / 281 » Set cover algorithms for very large datasets |
ICDE
2012
IEEE
13 years 8 days ago
2012
IEEE
—Sequence analysis is very important in our daily life. Typically, each sequence is associated with an ordered list of elements. For example, in a movie rental application, a cus...
SDM
2004
SIAM
14 years 11 months ago
2004
SIAM
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
DSD
2003
IEEE
15 years 3 months ago
2003
IEEE
We present a novel heuristic algorithm for two-level Boolean minimization. In contrast to the other approaches, the proposed method firstly finds the coverage of the on-sets and f...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Efficient training of direct multi-class formulations of linear Support Vector Machines is very useful in applications such as text classification with a huge number examples as w...
116
click to vote
SODA
2012
ACM
13 years 8 days ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...