2930 search results - page 476 / 586 » The optimal sequence compression |
162
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
151
Voted
KDD
2006
ACM
16 years 6 months ago
2006
ACM
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
195
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
159
click to vote
RECOMB
2006
Springer
16 years 6 months ago
2006
Springer
For as long as biologists have been computing alignments of sequences, the question of what values to use for scoring substitutions and gaps has persisted. While some choices for s...
160
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
Traditional timing-driven placement considers only combinational delays and does not take into account the potential of subsequent sequential optimization steps. As a result, the ...