2083 search results - page 196 / 417 » Perception and Experience in Problem Solving |
176
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
141
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Even though several techniques have been proposed in the literature for achieving multiclass classification using Support Vector Machine(SVM), the scalability aspect of these appr...
164
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
168
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
159
Voted
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
One of the most well-studied problems in data mining is computing association rules from large transactional databases. Often, the rule collections extracted from existing datamin...