2192 search results - page 126 / 439 » Algorithms for Challenging Motif Problems |
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
Monitoring a distributed system to detect a stable property is an important problem with many applications. The problem is especially challenging for a dynamic distributed system b...
MCS
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Oza’s Online Boosting algorithm provides a version of AdaBoost which can be trained in an online way for stationary problems. One perspective is that this enables the p...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
Feature selection is an important task in effective data mining. A new challenge to feature selection is the so-called “small labeled-sample problem” in which labeled data is...
AAAI
2004
13 years 9 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
CEC
2010
IEEE
13 years 9 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...