684 search results - page 48 / 137 » A characterization of b-perfect graphs |
132
Voted
EJC
2007
15 years 1 months ago
2007
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
114
click to vote
PAMI
2007
15 years 1 months ago
2007
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
FOGA
2007
15 years 3 months ago
2007
In the case where the search space has a group structure, classical genetic operators (mutation and two-parent crossover) which respect the group action are completely characterize...
111
Voted
DIMVA
2006
15 years 3 months ago
2006
Next generation malware will by be characterized by the intense use of polymorphic and metamorphic techniques aimed at circumventing the current malware detectors, based on pattern...
DAM
2006
15 years 1 months ago
2006
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...