219 search results - page 35 / 44 » Fast Algorithms for Finding Extremal Sets |
ECAI
2004
Springer
13 years 11 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
TMA
2010
Springer
13 years 5 months ago
2010
Springer
In the last few years the research community has proposed several techniques for network traffic classification. While the performance of these methods is promising especially for ...
CP
2009
Springer
14 years 8 months ago
2009
Springer
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
BMCBI
2006
13 years 7 months ago
2006
Background: Despite their involvement in the regulation of gene expression and their importance as genomic markers for promoter prediction, no objective standard exists for defini...